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.
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!
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.
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
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.
Kumar, you have my best wishes. And sure i will do an interview with you for that cracking interview for product based company. Wish you all the best my friend 😊👍
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?
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
Instead of creating a new list (which takes memory), he creates another variable k to be able to concatenate the elements in the correct order; using the space of one of the already existing lists, is it clear?
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?
no, not actually. because here i is incremented and after exiting the while loop that i value remains incremented. just print i value after while loop so that you can experience my logic.
Bhai anoop, yaar me bahut hi busy hu.. weekend me mera movie watching ka time nikalake ye video bana raha hu. I understand you guys want to learn fast but trust me I am on it. there is few more videos left but I have covered most of the content. Did you finished all exercises from this playlist?
@@mohammadmohsinmohammedmohs9717 You can implement EVERY SINGLE algorithm that you can in C/C++ in Python as well. Python generally isn't suited only because its a slow language in itself, but other than that there are no cons of using Python.
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
yes vishal... that will come up but not sure when. I am busy with deep learning and data structures series right now. once these are over I can work on other plans.