2.7.3 MergeSort in-depth Analysis

[@edwintan4784]

Seldom would u want t watch videos on Algorithms one after the other. But Prof Bari lectures r different! It is very addictive! U would want to keep on watching & have those Algorithms concepts demystified in a matter of minutes! Highly effective way of teaching! If there is a Nobel Prize in Teaching, Prof Bari will be the One & Only One worthy of this prestige!And he did this for free! His Udemy courses though r paid courses, but they r affordable! Glad that Prof Bari studied Computer Science, else there will be no one to explain Algorithms in a crystal clear manner. Thanks again Prof Bari!

[@yamashanmukhchandra636]

yeah it's truely addictive!.. :)

[@roushangiri4722]

Prof. Bari is doing million-dollar work for just for free. Damn! I wish I could meet you one day and thank you in person!

[@namitvarshney2142]

Professor Bari has reserved his place in HEAVEN :)

[@pkyadav6230]

No...but with god..whose child mr. Bari is..

[@jithinmv6516]

I wonder how these amazing contents are free. You are a hero sir.

[@instaminox]

You are the best Abdul thank you! ... I purchased the UDEMY course to support you.

[@RiteshNEVERUNIFORM]

He dosen't need your support, buy his course only if you want the skill of Programing

[@andistheinforitbutso7513]

@@RiteshNEVERUNIFORM fuck ur mentality. Shit in mind and street.

[@crazycolorfullife9049]

Its great that you are supporting him but he is already millionaire by Udemy and KZbin. Keep supporting him so that more and more students can be benefited.

[@nkgautam6161]

A great playlist by a Great professor.🙏🙏 Blessing from my depth of the Heart.

[@ravikiranreddyy3741]

8:04 that doubt raised and exactly that second he clarified it👍

[@mandeepsingh-be1ce]

This guy help me to make any sense of all these sorting techniques 🙏

[@marsdwarf]

Thanks so much for this video. I've been thinking about the space complexity of mergesort for some time. Now I understand it.

[@a4advanture755]

THANKS SIR YOU ARE TTTHE ONE OF GRREAT MAN GOD BLESSS YOU

[@anuragsaraf2424]

Thank you so much for this content. This is one of the best playlists we have for the algorithms

[@satyakibanerjee5793]

Nice explanation... your lectures cleared my doubts. Thank you sir. Please make videos on Bucket sort and Shell sort

[@sumirandahal76]

Skilled teacher, thanks sir

[@dheaneshwar]

Merge sort code from geeks for geeks seems to be in-place sorting the array. 7:34. Someone clarify. While it does use two arrays to store the sub array (space extra indeed) it does not use another array to store the result as 7:50.

[@subramaniyanvg6367]

Hats off to you sir very nice explanation.

[@moisesacero4995]

4:45 small space needed for external merge sort

[@withtheflow7526]

Thanks, sir for made Algorithm easy. Please Upload video series on Cloud computing in depth.

[@AnitShrestha]

Great analysis! Thank you.

[@JX304U]

Sir, keep up the good work. Thanks a lot.😀

[@SRNR_PODCAST.]

a gold mine in KZbin

[@harshdeep6281]

Sir, can you make a video on heap sort? It is not available in your current playlist of 80 algorithm videos.

[@xof8256]

It is there in Priority Queue video

[@groveroq]

@harshdeep it is there in the playlist kzbin.info/www/bejne/fqKze3logZqbb7c

[@dhairyashaherawala289]

Great understanding sir .

[@MDASIF-wo7ck]

Well explained sir .

[@saisrikar7987]

ur videos are really helpful..thanks sir1

[@nouf5184]

Thank You !

[@mohammedadel8948]

Thank you for your efforts

[@batman_1st]

sir you are amazing

[@moshfizzle925]

He split the merge sort videos recursively and we absorb all the information on the back end of the recursion lolol.

[@kishanpatel7782]

10:08 he knew Timsort as well that time it’s combination of insertion and merge sort

[@reassume4826]

अद्भुत।

[@aravindamisra1550]

Hello Sir, I have seen few implementations of in-place merge sort. Can you please make a video on why in-place merge sort time complexities could be higher?

[@vishaldhanani7241]

sir yeh sari video pehla aa jani thi ☺

[@eva42sh]

Thanks for the effort sir, and keep going , help students :))

[@mohaiminulislam5147]

Very helpful. Thank you, Sir

[@kinglygaurav]

Hello Sir! What do you mean when you said "It may be creating many activation records"? at 12:21. What is an activation record?

[@kinglygaurav]

@@abdul_bari Thank you sir. I just checked out that video. Again great job. You rock

[@rajatagarwal9282]

@@kinglygaurav hii in which video is it mentioned. the comment by sir seems t be deleted or missing

[@kinglygaurav]

Rajat Agarwal kzbin.info/www/bejne/r5iuYYyFg5ZjqbM Here you go man

[@rajatagarwal9282]

@@kinglygaurav Thankyou!!

[@vrindasinghal3654]

Hello, where can I find the video where you have compared all the sorting algorithms?

[@aniruddhashevle]

Amazing. Thank you so much SIR!

[@sabrinahaque987]

Sir,would you please make a video on bucket sort????It's very urgent...my exam is near...your videos are very helpful for me....

[@sagarchowdhury4u]

sir please provide the link where you have discussed all the sorting techniques based on various criteria as you said in this video

[@mridulanainani8048]

@@abdul_bari Sir please provide the link for all the sorting techniques based on various criteria if uploaded

[@JackyShaw]

@@abdul_bari sir please make that video, it will just take an hour for you but would save lives of many!

[@JackyShaw]

@@abdul_bari oh ok ok sir

[@preetikasoni7027]

sir , please make insertion sort analysis video

[@simonapopa9397]

great!

[@muhammadasif8069]

thanku sir

[@loluni6307]

Sir in vase of recursive process its also not in place sort ?

[@amanthakur4521]

Hello sir. Sir can you make us understand about convex hull problem and algorithm for closest pairs as it will be really helpful.Thank You very much!

[@pankaj2652]

How, for n

[@jianhe]

Hi, there. for NLogN. I only understand logN part, but I don't get the why we need multiple N.

[@faizrock5659]

Not all heroes wear capes, some have a white board and a marker.

[@vaasu3107]

Dear Abdul Sir, Thank you for the indepth lecture. Sir, you interchangeably use "log n" for sometimes height of the tree and sometimes as No. of levels in that tree. I am a bit confused, can you please explain??

[@vaasu3107]

Thank you Sir. 🙏

[@metra-2020]

nice sir

[@mansisinghal1634]

sirji ,If 2 list of size m and n are there ,what is time complexity in terms of no of comparison in merge sort???

[@aakashgarg4175]

m>n? O(mlog(m)) : O(nlog(n))

[@pranayghosh1162]

ravi,sunil; do u luv cricket?

[@nadeemiiui1815]

❤

[@prafful_sahu]

Watch in 2X speed

[@chitrakaseri5203]

vro apni voice edit karte samay he 2x pe rakha karo

[@kyokibot]

I know that my ex will always come here because she is studying algo now. I just wanna say, I miss you and I love you to the moon and back. I really do. Keep it up with your studies ok? ❤

[@prakash_reddy4]

2x is great

[@WaDaSiYehSan]

20191223

[@manishapanchal6997]

Sir ap hindi me vedio q nh bnate?