Sorting Algorithm Visualizer :Part 4 (Merge Sort)

Implementing and visualizing Merge Sort, which is a widely used sorting algorithm. We are going to use python to implement this algorithm.
It is mostly used to sort large data sets, because its time complexity does not change, it always is [n log(n)].

There are many optimizations , which you can implement and make it sort even faster.

-------------------------------------------------------------------

[jayeshl]

ur merge sort didnt work properly..pls tell the changes

[nirmitkhurana]

your mergesort didnt work, i guess there is a small error

[Tdigger]

Do you have patreon or paypal accounts? I would like to support your work.