We Sort it
for you!

Insertion Sort

Time Complexity: O(n²), O(n²)

Space Complexity: O(1)

Time Taken:

Merge Sort

Time Complexity: O(nlogn), O(nlogn)

Space Complexity: O(n)

Time Taken:

Bubble Sort

Time Complexity: O(n²), O(n²)

Space Complexity: O(1)

Time Taken:

Heap Sort

Time Complexity: O(nlogn), O(nlogn)

Space Complexity: O(1)

Time Taken:

Quick Sort

Time Complexity: O(nlogn), O(n²)

Space Complexity: O(nlogn)

Time Taken:

Count Sort

Time Complexity: O(n+k), O(k)

Space Complexity: O(k)

Time Taken:

Radix Sort

Time Complexity: O(d(n+b)), O(logb(mx)(n+b))

Space Complexity: O(n+b)

Time Taken:

Bucket Sort

Time Complexity: O(n+k), O(n²)

Space Complexity: O(n+k)

Time Taken:

7.4-5

Time Complexity: O(n+k), O(n²)

Space Complexity: O(n+k)

Time Taken:

8.2-4

Range Low:

Range High:

Preprocessing: O(n+k)

Calculation: O(1)

Time Taken:

Numbers Present: