Merge Sort | Simple Story | Story To Code | Recursion Concepts And Questions

Merge Sort | Simple Story | Story To Code | Recursion Concepts And Questions | Video 8

Рет қаралды 6,307

Күн бұрын

Пікірлер: 35

@yashthakur5712 9 ай бұрын

bhaiya trust me this channel is going to beat every single coaching which teaches DSA , kyuki kisi k paas esa methodolgy aur level hai hi nhi question ko smjhane ka

@codestorywithMIK 9 ай бұрын

It means a lot ❤️🙏

@PriyankaGupta-jp4rl 2 ай бұрын

Sir, I really never comment on any social media platform, but seeing your work, I can't stop myself. Your work is commendable.🙇‍♀🙇‍♀

@adamyasharma_0135 3 ай бұрын

always the saviour when no other youtube channel helps,THANK YOU SO MUCH

@noextrasugar 29 күн бұрын

video #8 - done coding. My most fav part is your motivational intro and the care you show for explaining small and big details. I am happy I have found this channel but sad I haven't found it earlier:( I understand a lot of Hindi ways of speaking after watching these lessons too lol

@codestorywithMIK 28 күн бұрын

This means a lot to me 🙏

@tomiokascuteness1909 5 ай бұрын

Damn, I was finally able to code without seeing the whole video. Just by learning concept from you. Your teaching way is great, watching this recursion playlist from the start and will surely complete it. Thankyou so much!

@priyanshkumar17 4 ай бұрын

agreed!!

@AshishTiwari-xe5oe Ай бұрын

thank you so much bhaiyaaa never understood merge sort this much deeply thanks a lot ❤❤

@illuminatination648 3 ай бұрын

God damn it itna acha kaiseeeee smjha sakta hai koiiii

@BG-lj6fw 8 ай бұрын

great content...i'm revising via ur channel to make my revision interesting and effortless.

@ratishjain2718 6 ай бұрын

best series on recursion

@JagannathDebGunin 9 ай бұрын

Was waiting for this dada Thanks a lot And I have started dp concepts, I am new to dp and I hope I will master it

@ArunSharma-hu4td 9 ай бұрын

Once again amazing and Clean Explanation ❤❤

@nileshdeshmukh7841 9 ай бұрын

Great Explanation ! , Can you please tell Time Complexity of all the problem as you told in Recursion : Time complexity video , It will help fresher to understood. Thankyou !

@sharadsingh2856 2 ай бұрын

Very helpful.

@SrishtiJaiswal-v5m 2 ай бұрын

Best video❤

@vishalsisodiya28 4 ай бұрын

This is something I've always had confusion about. I understand the process of merge sort (keep splitting until you reach 1, then as you exit out of recursion, you will have a smaller sub arrays to deal with and sort). Then in the merge part, you have to iterate through 2 arrays to make a sorted final array, and you will append that final sorted array into your original array (in the current range you are working in). But in this part, do you have to create a new array when combining those 2 arrays? Or should you directly modify the original array by iterating through it as you are sorting the 2 arrays? It seems like if you iterate through the original array, you might overwrite a value that you still haven't iterated through on either of the 2 sub arrays. But if you are making a new array altogether, doesn't this defeat the whole point of using minimal resources? Is there a way to do it without having to create a new array? Please clear my confusion

@omkarsawant9267 4 ай бұрын

In this final code Fill of R is wrong in for loop range Correct Filling of R: The for loop iterates n2 times, copying elements from arr[m+1] to arr[r] into R.

@SDE-tb3je 4 ай бұрын

While copying he did it mistakenly . So whoever wondering why it worked in code its just bcoz array is divided into equal parts always but for best practice and avoiding error follow above correction

@codestorywithMIK 4 ай бұрын

Thanks guys ❤️❤️❤️🙏🙏🙏😇

@wearevacationuncoverers 9 ай бұрын

Was waiting. thanks a lot mik

@jatakchatterjee1459 9 ай бұрын

You don't need to check for the case where the left half is exhausted. As we copied the temporary array (L and R) from the arr. Right half remains as it is. ie. sorted.

@wearevacationuncoverers 9 ай бұрын

@jatakchatterjee1459 , Do you mean, we can get rid of this part ? while(i < n1) { arr[k] = L[i]; i++; k++; }

@jatakchatterjee1459 9 ай бұрын

@@wearevacationuncoverers no. While(i

@wearevacationuncoverers 9 ай бұрын

@@jatakchatterjee1459 yes yes now I got it bro. thanks