2.7.1 Two Way MergeSort - Iterative method

preview_player
Показать описание
Video Covers
What is Merging ?
What is M-Way Merge ?
What are Merge Patterns ?

Two Way MergeSort is Different from Merge Sort

Two way MergeSort is Iterative Procedure
MergeSort is Recursive Procedure

Courses on Udemy
================
Java Programming

Data Structures using C and C++

C++ Programming
Рекомендации по теме
Комментарии
Автор

After 3 years of learning post-increment and pre-increment operators, this is the first time I'm seeing it used in an expression. I finally understand its actual use. I feel complete now

shereensuhail
Автор

You are the man... These vids are a gold mine.
I also got your c++ vids on Udemy, and they were very good as well!
Thanks for these!!!

bryphi
Автор

I never thought that Merge Sort could be this simple. Thank you sir for your lucid style of teaching... :-) No wonder you are very popular among the Youtube fraternity for your teaching style and of course the alogrithms...:-)

deshpasheeto
Автор

I love how he periodically stares at the camera like he's asking the viewer, "got it?" This is such a great breakdown of the merge function in the MergeSort algorithm. Kudos!

js_node_dev
Автор

YOU ARE THE BEST TEACHER FOR ALGORITHMS!!! I feel so confident in my concepts after watching your lectures sir, thank you so much!!

r.i.pmosquito
Автор

In my life you are the best teacher that i have seen

swarnimmukati
Автор

Hands down the best sorting video I've ever seen ! you've explained it in a way that it got printed in my memory ! Now I can explain this to someone else with the same level of clarity that was in the explanation of this video !

sabio
Автор

wow, your explanation is so simple and intuitive. audience dont' need to think it over and grasp the idea totally!!! you are the best! i will watch all your videos, for sure!

mikexue
Автор

I wish these videos existed in 2007, so my teachers could learn from this lol. Keep rocking sir!

kinglygaurav
Автор

Awesome explanantion..The pause that you create in your videos after explaining a fact gives us time to imagine, analyze, understand and link previous fact with current fact.So the list of facts are strongly linked with each other resulting in better understanding..God bless you..

chetanshrivastava
Автор

Your lectures seem well-versed and well-practiced, no fumbling, no forgetting any concept. One of the best Algorithms training (Playlist). Kudos for your excellent work

ayusharora
Автор

Very clear explanation, by the way you're a very good teacher ever!!!

viallykazadimutombo
Автор

This is the only video where it actually explains visually the extra while/for loop needed to join the "remaining" elements. It's been bugging me with the .extend() method in Python, but now I know why! Thank you kind sir!

bxav
Автор

DAA is getting easy now. thanks sir 😊😊😊

darkangel
Автор

Needless to say, Mr. Abdul you are one of the best teacher I have seen sofar on youtube on this subject

y
Автор

crystal clear explanation, awesome job sir, thanks a lot for this video 👍👍👍👍

SmartProgramming
Автор

Out of the many videos I've encountered on Merging, your explanations are always the clearest. Appreciate your videos.

ryuaan
Автор

i can't understand why I never had teachers like this. here i am watching every video in the series at 2x speed cramming for an upcoming exam learning at a pace that baffles even myself. thank you sir! god bless you and your family!

spacewad
Автор

One little detail: When comparing the two arrays, let's call them left and right, if they happen to be equal, pick the left one ( 5:50 the condition should be <=). This ensures the stability of the algorithm: equal elements will preserve the order they had in the original array. Example: if you had two 5's in the array, the first 5 will come before the second 5 even when you sort the list. Stability is not important if you're sorting plain old numbers but if the things you sort have other properties (like two human beings with age 35) you might want to keep them in the same order you originally had.

Deksudo
Автор

You are amazing. I thought merge sort is difficult you made it so easy that instead of looking the code i was able to write code from learning algorithm itself.

saisree