Scribd
Upload
2 views1 page

Sorting Algorithms Comparison Table

The document presents a comparison table of various sorting algorithms, detailing their time complexities, techniques, stability, in-place status, and parallelizability. Algorithms included are Insertion Sort, Selection Sort, Bubble Sort, Quick Sort, Merge Sort, Heap Sort, Topological Sort, and Counting Sort. Each algorithm's performance is categorized by best, average, and worst-case scenarios, providing a quick reference for their efficiency and characteristics.

Uploaded by

sss.081960z
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views1 page

Sorting Algorithms Comparison Table

The document presents a comparison table of various sorting algorithms, detailing their time complexities, techniques, stability, in-place status, and parallelizability. Algorithms included are Insertion Sort, Selection Sort, Bubble Sort, Quick Sort, Merge Sort, Heap Sort, Topological Sort, and Counting Sort. Each algorithm's performance is categorized by best, average, and worst-case scenarios, providing a quick reference for their efficiency and characteristics.

Uploaded by

sss.081960z
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Sorting Algorithms Comparison Table

Algorithm Time Complexity Technique Stable In-Place Comparison-B Non-Compara Parallelizabl

(Best / Avg / Worst) ased tive e

Insertion Sort O(n) / O(n²) / O(n²) Incremental Yes Yes Yes

(Greedy)

Selection Sort O(n²) / O(n²) / O(n²) Selection (Greedy) Yes Yes

Bubble Sort O(n) / O(n²) / O(n²) Swapping (Brute Yes Yes Yes

Force)

Quick Sort O(n log n) / O(n log n) / Divide & Conquer Yes Yes Yes

O(n²)

Merge Sort O(n log n) / O(n log n) / Divide & Conquer Yes Yes Yes

O(n log n)

Heap Sort O(n log n) / O(n log n) / Heap-based Yes Yes

O(n log n)

Topological Sort O(V + E) Graph Traversal N/A N/A N/A Yes

(DFS)

Counting Sort O(n + k) Counting (Bucket) Yes Yes

Distributed Counting O(n + k) (Parallel) Parallel Bucket Yes Yes Yes

Sort Counting

You might also like