Skip to main content

/Sorting/Radix Sort

1 / 8

Speed

/

Big O Notation Recursion Two Pointers Sliding Window Space Complexity Worst-case Analysis Memoization Greedy vs DP

Stack Queue Linked List Hash Table Binary Search Tree Heap Union-Find / Disjoint Sets Red-Black Tree

Bubble Sort Selection Sort Insertion Sort Quick Sort Merge Sort Heap Sort Counting Sort Radix Sort Shell Sort Bucket Sort

Binary Search Linear Search Jump Search Interpolation Search Quickselect / Median Finding

Breadth-First Search Depth-First Search Dijkstra's Algorithm Prim's Algorithm Kruskal's MST Topological Sort

Fibonacci DP Knapsack 0/1 Longest Common Subsequence

N-Queens Problem Sudoku Solver Maze Pathfinding

Sieve of Eratosthenes

45 algorithms·by Sai Rithwik Kukunuri

Radix Sort — Sorting

Custom array

Whole numbers 1–99, up to 16

170

45

75

90

802

24

2

66

0

1

2

3

4

5

6

7

Step 1:Initial array. Radix Sort will sort digit by digit, from least significant to most significant.

Variables

n==8

max==802

array==[170, 45, 75, 90, 802, 24, 2, 66]