WGU C949 Sorting/searching algorithms and their time complexities

0.0(0)
Studied by 1 person
linked notesView linked note
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/9

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 7:22 PM on 12/19/24
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

10 Terms

1
New cards

What are the complexities of Bubble Sort? Is it fast?

Θ(n²), no

2
New cards

What are the time complexities of Quick Sort? Is it fast?

O(n²) - Big-O(worst) | Θ(n log(n)) - average, yes

3
New cards

What are the time complexities of Selection Sort? Is it fast?

O(n²), no

4
New cards

What are the time complexities of Heap Sort? Is it fast?

Θ(n log(n)), yes

5
New cards

What are the time complexities of Radix Sort? Is it fast?

O(n), yes

6
New cards

What are the time complexities of Bucket Sort? Is it fast?

O(n²) - Big-O(worst) | Θ(n) - average, yes

7
New cards

What are the time complexities of Insertion Sort? Is it fast?

Θ(n²), no

8
New cards

What are the time complexities of Merge Sort? Is it fast?

Θ(n log(n)), yes

9
New cards

What are the time complexities of Linear Search?

O(n) - Big-O(worst) | Θ(n) - average

10
New cards

What are the time complexities of Binary Search?

O(log n) - Big-O(worst) | Θ(log n) - average