Sorting Algorithm TIme Complexity

0.0(0)
studied byStudied by 0 people
0.0(0)
full-widthCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/23

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

24 Terms

1
New cards

Quicksort - Best

O(n log n)

2
New cards

Quicksort - Average

O(n log n)

3
New cards

Quicksort - Worst

O(n2)

4
New cards

Mergesort - Best

O(n log n)

5
New cards

Mergesort - Average

O(n log n)

6
New cards

Mergesort - Worst

O(n log n)

7
New cards

Heapsort - Best

O(n log n)

8
New cards

Heapsort - Average

O(n log n)

9
New cards

Heapsort - Worst

O(n log n)

10
New cards

Bubblesort - Best

O(n)

11
New cards

Bubblesort - Average

O(n2)

12
New cards

Bubble sort - Worst

O(n2)

13
New cards

Insertion sort - Best

O(n)

14
New cards

Insertion sort - Average

O(n2)

15
New cards

Insertion sort - Worst

O(n2)

16
New cards

Selection sort - Best

O(n2)

17
New cards

Selection sort - Average

O(n2)

18
New cards

Selection sort - Worst

O(n2)

19
New cards

Bin/Bucket sort - Best

O(n+k)

20
New cards

Bin/Bucket sort - Average

O(n+k)

21
New cards

Bin/Bucket sort - Worst

O(n2)

22
New cards

Radix sort - Best

O(nk)

23
New cards

Radix sort - Average

O(nk)

24
New cards

Radix sort - Worst

O(nk)