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

Support us on Patreon: / geekific
GitHub Repository: github.com/geekific-official/...
Stay updated on our videos by subscribing to the channel and hitting the like button!
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:
- Abstract Data Types vs. Data Structures: • Abstract Data Types vs...
- New Features in Java 17: • New Features in Java 1...
- Sorting Algorithms Complexity: • Sorting Algorithms Tim...
- Generics and Wildcards in Java Made Simple: • Generics and Wildcards...
- Heap Space vs. Stack Memory in Java: • Heap Space vs. Stack M...
- Graphs, The Fundamentals: • Introduction to Graphs...
- Introduction to Unit-Testing with TDD: • Introduction to Unit-T...
- Dual-Pivot Quicksort Explained and Implemented in Java: • Dual-Pivot Quicksort E...
- TimSort Explained and Implemented in Java: • TimSort Explained and ...
#Geekific #SortingAlgorithms #MergeSort #Java

[@TechOnScreen]

gr8 work, good explanation.

[@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);

[@geekific]

Well done!