Merge Sort Algorithm Explained and Implemented with Examples in Java | Sorting Algorithms | Geekific

If you’ve watched our previous sorting algorithm videos, you might expect us to also cover one of the most efficient amongst them, and that is exactly what we do in this video. We explain, discuss and implement the merge sort algorithm.

Timestamps:
00:00 Introduction
00:49 Sorting an array using Merge Sort!
04:11 Merge Sort Implementation
13:31 The Merge Sort Algorithm v2.0
14:11 Putting our Code to the Test
14:57 Thanks for Watching!

If you found this video helpful, check other Geekific uploads:
- Shell Sort - Explained and Implemented:

#Geekific #SortingAlgorithms #MergeSort #Java

[FluteVJ]

At 5:50 you can improvise the code by using Arrays.copyOfRange() like below. It will be more concise. Pls correct me if I'm wrong.
T[] leftArray = Arrays.copyOfRange(arr, low, mid+1);
T[] rightArray = Arrays.copyOfRange(arr, mid+1, high+1);