Algorithms | Sorting Techniques | Merge sort algorithm, analysis and problems

Algorithms | Sorting Techniques | Merge sort algorithm, analysis and problems | Ravindrababu Ravula

Рет қаралды 526,602

10 жыл бұрын

For Course Registration Visit: ravindrababuravula.in/
. For Any Queries, You can contact RBR on LinkedIn: / ravindrababu-ravula
Telegram: t.me/ravindrababu_ravula
Instagram: / ravindrababu_ravula_rbr
- For Algorithms Full Playlist: • Algorithms - GATE Comp... Description

Пікірлер: 337

@akstyle6012 9 жыл бұрын

Well I have watched about may be 10 videos and all of them are awesome! And he puts all this efforts for free. This man deserves a salute.

@akstyle6012 9 жыл бұрын

ak style forgot to mention he's a genuis

@jaisamdariya4307 7 жыл бұрын

He has uploaded these for free so u can buy his full course which is worth 28k !

@rachitchhabra9578 7 жыл бұрын

40K

@initiator0016 5 жыл бұрын

@@jaisamdariya4307 43k now

@uchchwasdas2675 4 жыл бұрын

agree

@Rohitbhole1 6 жыл бұрын

Finally, someone I can call "sir" without hesitating..

@emanoelbarreiros 7 жыл бұрын

Great content! Helped me find a better way to teach the subject to my students.

@joelfrancis717 6 жыл бұрын

He manages to explain algorithms, recursion and big O notation perfectly with this one video! Excellent!

@akshaykadam4692 5 жыл бұрын

i'm damn sure that you will never find a better explanation than this on the internet for this particular algorithm.. thank you so much sir

@rituparnachakraborty6480 3 жыл бұрын

I am in love with his teachings..!!! way too good...!!!!! Simplifies anything and everything..!!! Thank God you were born Sir..!!!! This world needed you so much. Students like us who want to understand but can't find a proper tutorial anywhere need you so much..!!!! We want to learn..!!! Thank you very very much Sir...!!!!

@RAHULKUMAR-wj7cm 7 жыл бұрын

"Beauty of teaching" is what you just showed in your videos !!!! So glad to learn from here.

@ajinkyakirkire6561 3 жыл бұрын

Best explanation of Merge Algorithm using recursion

@saptarshibanerjee4757 7 жыл бұрын

Ravindra you are one of the best teachers out there! upload more videos and make students of india more knowledgable!!

@laxmibaid7149 8 жыл бұрын

this is like playing god.. i am pretty sure there no other video on the freaking internet that could explain it better!!

@karanveersingh9634 7 жыл бұрын

I am searching merge sort and watch more than a dozen of videos from last week but I stop here and this is so amazing to understand ,even IIT ,MIT lectures are not that much precise.

@sdsir7263 6 жыл бұрын

Laxmi Baid don't say God as creatures can't be God

@hackzyoboy2459 5 жыл бұрын

Go for mycodeschool. He explained better than RB

@madhoshyagnik3679 4 жыл бұрын

@@sdsir7263 oh! Rush me to the burn unit.....😂😂😂

@gaurav210 4 ай бұрын

@@hackzyoboy2459 he did not go this much into the detailing

@josevignesh9768 8 жыл бұрын

Really Good explanation. The way he explain is really great, he is giving nice example, with a example he is solving the algorithm. Great sir.

@vinayshukla6316 3 жыл бұрын

Best explanation of merger sort you can find on KZfaq. I already go throguh 2-3 videos today of merger sort but still didn't get how the mergeSort recursion is working. But now I am all clear.

@akashghosh4766 8 жыл бұрын

beautiful,how can a teacher be so fabulous?

@shaikzillani6106 4 жыл бұрын

The best video on internet, explaining merge sort !

@EalhamAlMusabbir 8 жыл бұрын

Thank u so much for this video sir.... :D I used to get bored watching tutorials made by others on Merge Sort.... But, your tutorials are just great as usual.... Thanks a lot for the effort sir.... Thank u so much... :D

@granceroblast 9 жыл бұрын

This is awesome!! Please upload more lectures on Algorithms!

@akhilpalem3917 7 жыл бұрын

i have seen few other videos as well for merge sort technique, but i didn't see any clear detailed explanation of the process like this, thanks a lot !!!

@jibinbaby7117 4 жыл бұрын

This is the right course which i was looking for.. no course explained the traversal... thannk you sir

@salounik.2894 7 жыл бұрын

The simplest and the best explanation yet.

@yaish9547 7 жыл бұрын

top class ! Why can't the professors in college be like him?

@etomndong9948 7 жыл бұрын

Good question bruh. Respects for this man

@kman2394 7 жыл бұрын

cause they don't really care

@patelfahad8319 6 жыл бұрын

Yaish Ahmad bcz they are not gate AIR 1 as Ravindra sir

@ashishnegi3848 6 жыл бұрын

rank 37 he is

@yatharth_er 5 жыл бұрын

unko itna nahi aata jitna sir ko atta hai

@prashantaacharjee3910 9 жыл бұрын

videos like these should at least reach 1 lakh views.best video on merge sort found on internet

@chulbuli_titli 4 жыл бұрын

Dude, the clarity is amazing.

@karanveersingh9634 7 жыл бұрын

excellent and very precise tutorial ,thank you sir.

@naasifn 3 жыл бұрын

You deserve a Nobel Prize man!

@vinaygade2644 8 жыл бұрын

the best lecture for very complicated merge sort !!! Really awesome!!!

@gumulurialekhya181 3 жыл бұрын

What an explanation sir🙇🙇no one literally no one can't explain like this😎😎 tq u very muchh.....

@shivamrunthala2165 6 жыл бұрын

This guy is genius.! He made it so easy.

@crystaldoll22 4 жыл бұрын

i searched and watched alllll videos..but this video is justttt perfect

@spyrakoslal5251 9 жыл бұрын

he's a great professor :)

@pratikaagnihotri2346 5 жыл бұрын

what a deep explanation !!! this has cleared all my basics....

@PlacidSoulLN 4 жыл бұрын

Thank you, bro. This video helped me a lot. After watching this I am a big fan of you.

@sonali9696 9 жыл бұрын

Your lectures are so much better than even d MIT lectures!! Seriously,amazing! :O You go into details which is what is truly needed to get a good grasp over the topic.MIT just skims through the topic and jumps to advanced analysis !

@MoutasemMohammad 7 жыл бұрын

you've never went to MIT obviously , skimming is only on OCW

@sonali9696 7 жыл бұрын

Of course I haven't went to MIT. But I could solve more questions after doing these lectures rather than doing those lectures. Everyone has their own preferences

@BrajeshKumar-ez8zs 6 жыл бұрын

vishnu priyan you are just showing that you have a brain which is worse than my shit. RB himselfs says that he is lectures are made for gate... And is not wholesome. He goes below at ur level so dumbass like u can understand.. If you can not understand anything from mit's lecture.. Bcos they assume u know the base.. Nd they don't waste time. Now if ur brain is full of shit... It's your fault

@BrajeshKumar-ez8zs 6 жыл бұрын

vishnu priyan see.. I said you have shit in ur brain. And it stinks too like ur comment. The professors whom you are able to see becos of a noble initiative are far beyond ur reach. Not every one can be a part of ivy league. Respect them. Their hardwork. If u feel u r not getting it.. It bcos ur brain has dark yellow metter (not grey).and don't worry about me if I don't know anything i'll learn it if it is neccesary.

@Confusedalien1133 6 жыл бұрын

Brajesh Kumar your dna* learn English first you dumb fuck

@shashwattrivedi9940 7 жыл бұрын

sir you are awesome your videos proved to be very useful in acquainting the in depth knowledge in toc and data structures thanks a lot for uploading such precise videos

@surana129 8 жыл бұрын

Salute you sir. After 15 days effort i was able to understand the merge sort. If i get your lecture 14 days before i would be able to understand it in one day . Thank you

@karanveersingh9634 7 жыл бұрын

same here

@gauravgogoinitsilchar4146 3 жыл бұрын

Teachers should be like this man! others' use similarly you will get but it makes things complicated

@bradparker3150 8 жыл бұрын

You are a talented instructor ! Thanks

@jahirulislammonir3490 8 жыл бұрын

Great work u have done.. keep going on..

@raushansingh9905 5 жыл бұрын

dmm merger sort was never easy before, thanks a lot for making it easy for me.

@shivamnandha8075 5 жыл бұрын

Totally worth it to spend hour for this level of content....😊

@mysecretuser 8 жыл бұрын

Hats off sir. Please add videos about Graphs and its complexity

@iemranee 8 жыл бұрын

Hats off Sir .. May God bless you for all your efforts.

@imrn4u 4 жыл бұрын

thanks for being "the teacher" for everyone

@swethag3990 6 жыл бұрын

Sir super explanation sir . It is very easy to understand👏👏👌👌👌

@sushmitanigam5787 10 жыл бұрын

superb lecture and awesome teaching..i understood merge sort completely. u are the best teacher sir i am your fan now... plz plz upload more such lectures

@ramendernegi9789 4 жыл бұрын

Yes

@saipriyabalu1 7 жыл бұрын

Your lectures are very helpful. Thanks a ton!

@hassanahamed7669 8 жыл бұрын

finally got to know full fledged about merge sort. :) tq sooooo much

@sunnyjain630 7 жыл бұрын

great explations sir it clears all my doubts regarding merge sort algo......thanks

@likithr.n9692 4 жыл бұрын

You are the god of computer science....

@Gigglezonee 7 жыл бұрын

ur teaching is so beautiful that I never forget. .thk fr such gud video. .u deserve 👏👏👏👏

@photosandvids1862 7 жыл бұрын

love the way you speak. i can hear you all day.

@BrewingHappinessrocks 8 жыл бұрын

sir hats off to you...thank you for such great efforts of yours :) u are such an amazing teacher

@VikramGupta20 9 жыл бұрын

Nice explanation of recursion! Thanks!

@VinodKumar-po7sj 8 жыл бұрын

Very good tutorial. Thank you for your efforts. :)

@vamsikrishna3634 5 жыл бұрын

You explanation is simply awesome everyone can understood easily

@konstantinrebrov675 5 жыл бұрын

Indian professors are the best!

@mohit4231 9 жыл бұрын

Awesome explanation was looking for same . Thanks :)

@robertsan529 8 жыл бұрын

Dude! You're awesome!

@bujjibabulingampalli9648 9 жыл бұрын

This is awesome sir..!! Please upload more lectures on datastructures

@sauravsahu6243 5 жыл бұрын

Very nice explanation Sir. Many many thanks to you for sharing knowledge :)

@naveenkumarrai8063 5 жыл бұрын

awesome teaching style.thanks for this cooperation sir

@r.sundarraj9722 6 жыл бұрын

Great to see ur lectures in a well defined manner. We (Me and my friend Gopi) were really impressed! All the Best for ur future plans.........

@jomoljohn215 6 жыл бұрын

Thank you Sir, I solved lots of my confusion with your video

@tanyasrivastava8719 6 жыл бұрын

in the two sorted lists we create, how to assign infinity to the last elements of the array?

@swetapanda1995 7 жыл бұрын

asm video...ncly explained...got the concept...flng very happy...thnk you sir

@rupeshchoudhary9237 4 жыл бұрын

You are amazing teacher. I love your lectures even though i am not from Computer science background

@radekfriedl1646 8 жыл бұрын

Great explanation, thanks.

@shreyrao5514 8 жыл бұрын

Excellent explanation sir, helped a lot. Thank you so much sir

@13Uzamakifan 7 жыл бұрын

instead of adding a large enough number at the end of the left and right lists respectively, wouldn't it be better to add a conditional that says if one of the pointers reaches the index of the size of the list -1, then just copy the remainder of the other list from its pointer and add it to the main list?

@nitinnindane9775 6 жыл бұрын

Sir you have assigned last element of array L & R with infinity how to do it while programming in c

@mayankdagar7 6 жыл бұрын

I RESPECT U >>>GREAT SIR ....Future superstar ...good wishes sir

@reena.m8471 8 жыл бұрын

you explain it very well . thanks for your efforts. can you add some videos on red black tree

@pythonicprogramming 6 жыл бұрын

The best ever, the best thing is that you started from merging.

@rebeccakipanga478 10 жыл бұрын

Clear and neat!!! Thanks sir!!

@MultiHarsh111 8 жыл бұрын

All of your tutorials are very nice. Is there anything on Dynamic Programming?

@BrewingHappinessrocks 8 жыл бұрын

sir I wanted to ask you one thing ..like we are using recursion so first time our mid value came to be 3 which is fine then again tht same function will call itself till p becomes less than q but in this way thn how it's going to next step ..loop will break when condition becomes false ..so how will the same function works for other half ?

@arshithakm211 7 жыл бұрын

superb class...thnk uh sir

@gokulbaby 6 жыл бұрын

Sir,why is the time taken in the list of size n/logn=O(nloglogn) and in the string case=O(n^2logn)...I mean isn’t it still loglogn climbings again?

@arghyac35 7 жыл бұрын

Very very helpful..thank you very much....

@AlokMishra_tech 5 жыл бұрын

Sir I have a problem that ... We are dividing the problem in parts as we done in binary search and we call the function again and again then why we are not considering the time taken to divide the problems into subproblems and also in CLRS time taken to divide the problem is as constant why it is as ?

@ayanmandal8257 3 жыл бұрын

Do we have to create new array for every call of merge sort function ?plz answer

@shubhamagarwal1434 2 жыл бұрын

u r the best Sr...Shat Shat Naman...

@mohithjagalmohan 4 жыл бұрын

For the question on sorting n strings of size n in lexicographical order, the time taken could be tightened to O(n^2) instead of O(n^2 log(n)) as he said. Just use the recurrence T(n) = T(n/2) + O(n^2) and apply masters theorem.

@rajajodhani 9 жыл бұрын

Sir, thanks for giving me this much please change the keywords for search in youtube because people dont hav access to it easily... this lectures hav to got more than 1 lakhs likes and views thanks sir

@pradeepagarwal1962 7 жыл бұрын

wonderful videos....pls provide videos related to interview

@RamanMahajanhsp 9 жыл бұрын

Cool explanation..... Keep it up

@sreeram767 7 жыл бұрын

wonderful lecture :)

@khushvindervaid6499 7 жыл бұрын

well taught sir, u r the best::)

@samudragupta719 5 жыл бұрын

Best so far I've gone through!

@adityamohan4615 6 жыл бұрын

is it the divide and conquer approach?

@himanshuparmar1719 8 жыл бұрын

Sir....you have great teaching skills...Please make videos on Graph, DP, Binary search, Bit manipulation etc..

@atkuriajaykumar3701 3 жыл бұрын

He already made them you need to buy the course from his website

@saumyasundaram8759 5 жыл бұрын

what an awesome feeling when we r able to solve after watching this 《3

@sulaimanhussain2974 7 жыл бұрын

excellent tut.....help me a lot. sir.what is the best book for algorithms.

@johnfox17 6 жыл бұрын

Master! Thank you!

@arul2897 7 жыл бұрын

Sir, when u started the example part.. U said log 2=1 that is possible only when log has a Base=2... So how do we decide the Base of log?

@sureshmaharajashekar5671 6 жыл бұрын

great presentation , Thanks a lot

@parkhisharma5969 8 жыл бұрын

can we have lectures , explaining counting sort radix and bucket sorts plzz??and also some questiond on iteration method of solving recurrence in algorithms?