Sample Sort is a divide-and-conquer sorting algorithm that selects a sample of elements to determine splitters for partitioning the array, recursively sorting each partition for efficient parallel or sequential sorting.
Paradigm
Divide & Conquer / Sampling
Author
Peter Sanders
Tier
Time Complexity
Best
Avg
Worst
Space
O(n)
Properties