Algo & Complexity 13 - Merge Sort

Merge Sort is a divide-and-conquer sorting algorithm. It recursively divides the unsorted list into "n" sub-lists, each containing one element, and then merges these sub-lists in a pairwise fashion until only one sorted list remains. It leverages a merge operation to combine two sorted arrays into a single sorted array. Merge Sort has a stable time complexity of O(n log n) in the worst, average, and best cases, making it efficient for large datasets. Its main advantage lies in its consistent performance and suitability for linked lists. However, it requires additional space for the merging process, making it less memory-efficient compared to in-place sorting algorithms.

I have provided an implementation for this algorithm in javascript series as an exercice to explain recursion :
   • JavaScript 37 - Le Tri par Fusion - Exerci...  

Video by : Dr. Chohra Chemseddine, Lecturer at University 8 mai 1945 Guelma.
My web page : http://staff.univ-guelma.dz/chemseddi...
Linkedin :   / chemseddinechohra  
Research gate : https://www.researchgate.net/profile/...

Facebook :   / profinfordz