Stability

Merge Sort vs Quick Sort: What is the Difference?

Merge sort splits an array in half, recursively sorts both halves, then merges them, guaranteeing O(n log n) time and stability at the cost of O(n) extra space…

What is Counting Sort?

Counting sort sorts integers by counting how many times each distinct value occurs, converting those counts into prefix sums that give each value its final pos…

What is Radix Sort?

Radix sort sorts integers (or fixed-length strings) by repeatedly applying a stable sort, usually counting sort, on one digit position at a time, moving from t…

What is Insertion Sort?

Insertion sort builds the final sorted array one element at a time by taking each new element and shifting it leftward past every larger already-sorted element…

What is Selection Sort?

Selection sort repeatedly scans the unsorted portion of an array to find the minimum element and swaps it into place at the front, giving an O(n²) comparison-b…

What is Shell Sort?

Shell sort is an in-place comparison sort that generalizes insertion sort by first comparing and swapping elements far apart using a shrinking gap sequence, mo…

What is Timsort?

Timsort is a hybrid, stable sorting algorithm — the default in Python’s sort() and sorted() and in Java’s Arrays.sort() for objects — that finds naturally occu…

What is Bubble Sort?

Bubble sort repeatedly steps through an array comparing each pair of adjacent elements and swapping them if they are out of order, so on every full pass the la…