Merge sort visualization (2500 elements)
Uploader Comments (account1011011)
Top Comments
-
OMG, I don't fully understand the concept behind the merge sort, I can imagine the sort of stuff it involves, and this is awesome!
All Comments (8)
-
What is the music to this video?
-
One big advantage of a merge sort (which wasn't done here) is parallel processing. It's as if you had a huge pile of dockets in random order. And you have many helpers.
So you give everybody a pile of dockets to sort. As each bundle gets sorted you will have some sorted bundles and some unsorted bundles. Then get people merging bundles until you have only two big bundles left. Which you then merge together.
The process may mean extra comparisons but it's very fast.
-
@patrickcorliss KK thnx for explaining it, I was around right in what I thought it was.
-
As I understand it a merge sort is what many people do naturally when they are sorting a bit pile manually. Say a pile of dockets into date order.
You sort the pile into order until it gets a bit too big to manage. Then you start another pile. Eventually you merge the two piles by turning over dockets in one pile and inserting from the other pile. Then you start on another pile.
I do it manually all the time.
-
can i have the code? this is awesome!!!
Well done sir. I like this.
thexoor 4 months ago 6
@thexoor Thanks!
account1011011 4 months ago