Merge Sort Made Simple | O(n log n) Complexity Explained

O(n log n) shows up everywhere in efficient algorithms — especially sorting. In this short video, we break down what “quasi-linear time” really means, using merge sort as a clear and simple example. You’ll see how merging works, how merge sort builds from it, and why its time complexity is O(n log n). Perfect for anyone learning Big O step by step. #mergesort #algorithm #python #algorithmanalysis #bigonotation #motioncanvas