Sorting Algorithm( comparison based and non comparison based).pdf

I summarised the comparison based and non comparison based

1. NAME : HABIBU MUHAMMED.
DEPT. : COMPUTER ENGINEERING.
COURSE : DESIGN ALGORITHMS.
DATE : 09/10/2025
PURPOSE : ASSIGNMENT 1.
WHAT IS SORTING ALGORITHMS?
ANSWER

2. What is a Sorting Algorithm?
A
an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20]
after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in
decreasing order.

3. Classification of Sorting Algorithms

5. •

7. •

10. •
+

12. •

15. •

18. •

22. •
•

28. •

30. •
Comparison Table

31. Algorith
m
Time
Complexi
ty (Best)
Time
Complexi
ty
(Average
)
Time
Complexi
ty
(Worst)
Space
Complexi
ty
Stable?
In-
Place
?
Bubble
Sort
O(n)O(n²)O(n²)O(1)YesYes
Selectio
n Sort
O(n²)O(n²)O(n²)O(1)NoYes
Insertio
n Sort
O(n)O(n²)O(n²)O(1)YesYes
Merge
Sort
O(n log n)O(n log n)O(n log n)O(n)YesNo
QuickSo
rt
O(n log n)O(n log n)O(n²)O(log n)
Typical
ly No
Yes*
Heap
Sort
O(n log n)O(n log n)O(n log n)O(1)NoYes
Countin
g Sort
O(n + k)O(n + k)O(n + k)O(n + k)YesNo
Radix
Sort
O(d(n +
k))
O(d(n +
k))
O(d(n +
k))
O(n + k)YesNo