Sorting Algorithms
Quick Sort
Speed120ms
Size30
Complexity
Best: O(n log n)
Average: O(n log n)
Worst: O(n^2)
Space: O(log n)
Writes per step
Current Event
—
Merge Sort
Speed120ms
Size30
Complexity
Best: O(n log n)
Average: O(n log n)
Worst: O(n log n)
Space: O(n)
Writes per step
Current Event
—
Bubble Sort
Speed120ms
Size30
Complexity
Best: O(n)
Average: O(n²)
Worst: O(n²)
Space: O(1)
Writes per step
Current Event
—
Insertion Sort
Speed120ms
Size30
Complexity
Best: O(n)
Average: O(n²)
Worst: O(n²)
Space: O(1)
Writes per step
Current Event
—
Selection Sort
Speed120ms
Size30
Complexity
Best: O(n²)
Average: O(n²)
Worst: O(n²)
Space: O(1)
Writes per step
Current Event
—
Heap Sort
Speed120ms
Size30
Complexity
Best: O(n log n)
Average: O(n log n)
Worst: O(n log n)
Space: O(1)
Writes per step
Current Event
—
Radix Sort
Speed120ms
Size30
Complexity
Best: O(d(n+k))
Average: O(d(n+k))
Worst: O(d(n+k))
Space: O(n+k)
Writes per step
Current Event
—
Counting Sort
Speed120ms
Size30
Complexity
Best: O(n+k)
Average: O(n+k)
Worst: O(n+k)
Space: O(k)
Writes per step
Current Event
—
Bucket Sort
Speed120ms
Size30
Complexity
Best: O(n+k)
Average: O(n+k)
Worst: O(n²)
Space: O(n)
Writes per step
Current Event
—
Shell Sort
Speed120ms
Size30
Complexity
Best: O(n log n)
Average: O(n^1.3)
Worst: O(n²)
Space: O(1)
Writes per step
Current Event
—