Merge sort

In computer science, merge sort (also commonly spelled mergesort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the order of equal elements is the same in the input and output. Merge sort is a divide and conquer algorithm that was invented by John von Neumann in 1945.[2] A detailed description and analysis of bottom-up mergesort appeared in a report by Goldstine and von Neumann as early as 1948.

Clicking on this step you can see the Video learningstep of the algorithm.

Video

As a first step you will be able to watch the video representation of the Bubble sort algorithm. This will be presented by hungarian folk dance.


Pay attention and try to understand the main movements of the sorting algorithm, namely the comparison, selection and swap.


This technique involves human movement effect in order to visualize the algorithm in a dinamic way. Enjoy it! :)