Merge Sort
mergesort
Merge sort is a divide-and-conquer sorting algorithm. It recursively divides the input list into smaller sublists until each sublist contains only one element (which is inherently sorted). Subsequently, these sublists are merged pairwise in a sorted manner to produce new sorted sublists until the entire input list is merged into a single sorted list. Its time complexity is O(n log n) in all cases.
9 connections Built by Tim Jones