Merge Sort - Data Structures & Algorithms Tutorial Python #17 

Do you want to learn python from me with a lot of interactive quizzes, and exercises? Here is my project-based python learning course: codebasics.io/courses/python-for-beginner-and-intermediate-learners

I was watching merge sort code from different different blogs and different different youtubers but I haven't get anything. Today accidentally I watch this video. I understood everything. The way you teach is really awesome sir. Thank you from full of my heart 🖤

2 lectures left till i complete your full playlist, tysm i have been following your playlist since last month seeing it every day 1-2 hrs...it helped me learn dsa ...tysm...really it will always be a part of me in future..

Learning DSA is one thing, but what I admire most about you is your line of thinking - how you start simple and slowly build on to it. I personally start with every problem, thinking in all directions at the start, and run into analysis paralysis. The way you teach is much appreciated.

please make more on these algo's the most imp every cs student should know

thank you very much bhaiya !! Now after practicing this on my own ,I can say my merge sort is clear , and i can move to other topics

really good tutorial, definitely liked the different approach of starting with the merge function then moving in to the main recursive part.

I love your videos man! I will be contributing to your channel once I start earning!

I understood merge sort only after watching your video..Thankyou sir..

You're one of the Best. You deserve a hat trick of subscription if that was possible.

no one: codebasics: we are gon "short" the array. anyways, great video sir! understood!

I think a better approach would be to say: # If a reached the end of list a add the remainder of b to sorted_list, and vice n verca if i == len_a: sorted_list += b[j:] else: sorted_list += a[i:] This way you avoid running extra loops

This is a great video. It's a different perspective than what I've seen in other videos but it really works. I'd highly recommend this video for someone new or as a refresher. Fabulous

This lecture series is the best learning I have had in Data Structures, thank you so much for sharing the information in such a simplified form and thank you for motivating every single time to perform the activities. Completing the activities gave me a great confidence in coding in Python. Thank you so much Dhaval Sir, this was very very helpful!

Best video ever i tried many video for understanding merge sort but this is the only one i was able to understand properly.

very well explained sir with bottom-up approach..

This is simply beautiful. You are very good teacher. Very lucid explanation. Thanks.

I skipped this algorithm a lot of times. Finally, I understood. From class 12 to MCA. That's how long it took me to understand this algorithm

THIS IS THE BEST EXPLANATION OF THIS ALGORITHM BY FAR!!!!!!!

While doing the in memory merge sort, we cannot simply write, arr[k] = a[i] and similary arr[k] = b[j] we have to swap them as variables arr, a and b........all are pointing to the same list in memory. so if we do arr[k] = a[i], this will lead to a data loss as the original value at arr[k] will be overwritten. This became apparent when trying to attempt the exercise. I believe over looking this was intentional on part of the teacher.

sir please continue uploading videos. why did you stop at 19th video

You're a genius.

One of the good things is you share other resources (like Khan Academy). Other trainers like to keep good resources to themselves. Thank you!!

thank you man you have explained very well in detail much appreciate it and subscribed

amazing teacher

I recommend that you start from search and sort algorithms first and then learn the data structure, it will help you in recognizing the functions

Helped me to understand, Thanks!

the best part is your exercises. Please keep up the great job and thanks

Awesome explanation..... Love it

Your Teaching is too good sir.. Thankyou for the course

Well done, so clear and helpful

Thank you :D this seems a lot more easier now🙌✨

Excellent explanation!

What a great teacher!

Excellent.

Hi Dhaval, Perfect example and clear code, once again from you. Have a query which I am trying to get clarified for sometime now. How do we use merge sort for array of odd number of elements.? I needed to have the code for the same. Please help! Krish

Thanks ,clean explanation

Thanks so much

I always laugh at the veiled threats for prematurely clicking on the Solution in the Exercise... XD

Thanks for this explanation, sorted all my problems ;)

Please make a video on different types of algorithm like DFS, BFS etc.

Dhaval bhai @codebasics, bs aap videos banaye bolke I have revived my long crushed dream to prepare for google, cas i always was afraid of DS and Algo topics. Ab aap padha rahe ho to nhi hai darr. I am starting again and I will not let it go this time. Bhai next destination -> aapke channel pe interview "how i cracked a product company interview". Wish me luck, long road ahead.

Instead of using while two times we can use sorted_list= sorted_list+a[i:]+b[j:]

Thanks!

Thank you ♥♥

I just want to know one thing, you just eliminated a new array just to save memory and other optimisations, but even left and right variable that we use are storing as many lists right?

Thanks for sharing this video...it is easy to understand....could you please make some videos on Recursive function?

sir would you mind sharing the name of compiler you use for python programming.

Hello Sir, can you please create a video developing of project using only DSA ?

But why will the technique not work on unsorted arrays?

When you will announce the giveaway winners?

merge_two_sorted_list function only performed on sorted list ??? I'm Right Na

Sir it's easier to sort list or int it's difficult tonsolve strings and dictionary so I have no clue how to even approach the exercise problem you have given

If __ name__ == '__main__': can anyone explain this line, why use this line? Thank u

I didnt get why at the end you add k ?? It worked without it ....

hey just wondering when we are using the two while loops outside the main while loop. will it not simply append the remaining elements of either the list without comparing the remaining values?

Can you recommend some books with Data Structures with Python as well?

Sir should we learn C/C++ to understand DSA, i know C language(1st year enginnering) but i know python very well. Should i follow this series??

Hello sir how are you? I Gotta a big trouble please help me i have formated my laptop accidentally and lost all my 500 gb data plzzzzz plzzzz tell me how can i recover my data after making new partition again.plzz replay me ASAP

woahhhhhhhhhhhhhhhhhhhh

Sir how to edit vedios like u I love ur Contnt and editing

4:53 😅😂😂

alag se while loop ki zaroorat hi nahi thi pahele me hi or karna tha and nahi

Sir aap RU-vid channels ko leke ek series Banane wale the apane dusare channel pe??

merge_sort method is not sorting in my case!!

Sir is this the last tutorial in this series?

Sir c++. python which is better in future in data structure data

didn't understood.