Merge Sort Visualization, Implementation using Python | Sorting Algorithm Visualization #4

Explaining, 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.

---------------------------------------------------------------------------------------------------
---------------------------------------------------------------------------------------------------
(if you want to grab me a cup of coffee)
---------------------------------------------------------------------------------------------------

[somakchakraborty]

Hey Dennis amazing work! Loved the entire series of sorting visualization. Would love it if you can add the heap sort algorithm to the series as well.

[omkarsanas]

Thanks for amazing 4 videos! All of them were easy to learn and understand <3 Keep it Up :D

[caiofernandes]

Awesome! Quicksort and Merge sort inplace algorithms were both that I was trying to figure out how to implement. Now I was able to implement also using matplotlib.

[anoop_bhat]

Hey thanks for the amazing videos of sorting visualizer.
You should also make videos on path finding visualizer using Dijkstras and A* algorithms.

[ardiasx]

Hello dennis, i had a problem with algorith/vscode but idk which one. So i try your code step by step and try to running it and it's perfect work but when i try to start sorting it's really-really slow ( i change it to 2 ) and when i try to click something the program is not responding. Can you help me with this problems? and btw you did a amazing work

i hope you answer this and sorry for bad english :D