Scribd
Upload
11 views

Sorting Algorithms

Uploaded by

saimistry3
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
11 views

Sorting Algorithms

Uploaded by

saimistry3
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
You are on page 1/ 12

M Owaish Bhada

owaishbhada@gmail.com

All About

Sorting

Algorithms
Swipe for more
M Owaish Bhada
owaishbhada@gmail.com

Bubble Sort
Space Complexity: O(1)

01 Best Case: O(n)

Average Case: O(n2)

Worst Case: O(n2)

Stability: Stable

Method of Sorting: Exchanging

Implementation Complexity: Easy

2 / 12
M Owaish Bhada
owaishbhada@gmail.com

Selection Sort
Space Complexity: O(1)

02 Best Case: O(n2)

Average Case: O(n2)

Worst Case: O(n2)

Stability: Unstable

Method of Sorting: Selection

Implementation Complexity: Easy

3 / 12
M Owaish Bhada
owaishbhada@gmail.com

Insertion Sort
Space Complexity: O(1)

03 Best Case: O(n)

Average Case: O(n2)

Worst Case: O(n2)

Stability: Stable

Method of Sorting: Insertion

Implementation Complexity: Easy

4 / 12
M Owaish Bhada
owaishbhada@gmail.com

04
Heap Sort
Space Complexity: O(1)

Best Case: O(n log n)

Average Case: O(n log n)

Worst Case: O(n log n)

Stability: Unstable

Method of Sorting: Selection

Implementation Complexity: Moderate

5 / 12
M Owaish Bhada
owaishbhada@gmail.com

05
Bucket Sort
Space Complexity: O(n + k)

Best Case: O(n + k)

Average Case: O(n + k)

Worst Case: O(n2)

Stability: Stable

Method of Sorting: Distributing

Implementation Complexity: Moderate

6 / 12
M Owaish Bhada
owaishbhada@gmail.com

06
Merge Sort
Space Complexity: O(n)

Best Case: O(n log n)

Average Case: O(n log n)

Worst Case: O(n log n)

Stability: Stable

Method of Sorting: Merging

Implementation Complexity: Moderate

7 / 12
M Owaish Bhada
owaishbhada@gmail.com

Shell Sort
Space Complexity: O(1)

07 Best Case: O(n log n)

Average Case: Depends on gap size

Worst Case: Depends on gap size

Stability: Unstable

Method of Sorting: Insertion

Implementation Complexity: Moderate

8 / 12
M Owaish Bhada
owaishbhada@gmail.com

Quick Sort
Space Complexity: O(log n)

08 Best Case: O(n log n)

Average Case: O(n log n)

Worst Case: O(n2)

Stability: Unstable

Method of Sorting: Partitioning

Implementation Complexity: Moderate to Hard

9 / 12
M Owaish Bhada
owaishbhada@gmail.com

Comb Sort
Space Complexity: O(1)

09 Best Case: O(n log n)

Average Case: O(n2 / 2p)

Worst Case: O(n2)

Stability: Unstable

Method of Sorting: Exchanging

Implementation Complexity: Moderate

10 / 12
M Owaish Bhada
owaishbhada@gmail.com

10
Radix Sort
Space Complexity: O(n + k)

Best Case: O(nk)

Average Case: O(nk)

Worst Case: O(nk)

Stability: Stable

Method of Sorting: Distributing

Implementation Complexity: Moderate

11 / 12
M Owaish Bhada
owaishbhada@gmail.com

Save for

Later!
12 / 12

You might also like