CS32: Time and Space Complexities of Sorting Algorithms

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/10

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.

11 Terms

1
New cards

insertion sort space

o(1)

2
New cards

insertion sort time

o(n) best,o(n²) avg, o(n²) worse

3
New cards

bubble sort time

o(n) optimized version best o(n²) best o(n²) avg o(n²) worse

4
New cards

bubble sort space

o(1)

5
New cards

selection sort time

o(n²) all cases

6
New cards

selection sort space

o(1)

7
New cards

merge sort time

o(nlogn) all cases

8
New cards

merge sort space

o(n)

9
New cards

quick sort time

best o(nlogn) avg o(n log n) worse o(n²)

10
New cards

quick sort space

o(log n)

11
New cards

lumuto space