Merge Sort Algorithm: A Step-by-Step Visualization

Hi everyone! In this 3 minute video, I will explain merge sort (mergesort) with two easy examples with input arrays. Then, I will go through the code for merge sort with Java.

Merge sort is one of the most complex algorithms used for sorting numbers in an array. It has the worst case, best case, and average case time complexity of O(nlogn), where n is the size of the array to be sorted. Pretty much all computer science students will learn to sort through numbers in the Data Structures and Algorithms course, just like merge sort. However, merge sort is still not the best sorting technique, as quick sort is way more efficient and uses less memory.

In the next video, I will go over quick sort, bucket sort, and radix sort, respectively.

Please leave a like and subscribe if you found this video helpful!

LIKE & SUBSCRIBE:

MY EQUIPMENT:
✅Camera: Samsung Galaxy J7
✅Editing Software: Shotcut

[GlebC-ouiz]

This tutorial was great! Very clear and actionable.

[st-lucia]

wonderful tutorial. Thanks for the quick explanation!

[itstaw]

I Love the content and have gained a lot from watching your tutorials about sorting algorithms! Thank you!