WGU C949 BIG O BEST, AVERAGE, WORST CASE

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/11

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.

12 Terms

1
New cards

Linear Search

○ Best Case: O(1)

○ Average Case: O(n)

○ Worst Case: O(n)

2
New cards

Binary Search

○ Best Case: O(1)

○ Average Case: O(log n)

○ Worst Case: O(log n)

3
New cards

Interpolation Search

○ Best Case: O(1)

○ Average Case: O(log log n)

○ Worst Case: O(n)

4
New cards

Depth-First Search (DFS) & Breadth-First Search (BFS)

○ Best Case: O(1)

○ Average Case: O(V+E)

○ Worst Case: O(V+E)

5
New cards

Bubble Sort & Insertion Sort

○ Best Case: O(n)

○ Average Case: O(n^2)

○ Worst Case: O(n^2)

6
New cards

Selection Sort

○ Best Case: O(n^2)

○ Average Case: O(n^2)

○ Worst Case: O(n^2)

7
New cards

Merge Sort & Heap Sort

○ Best Case: O(n log n)

○ Average Case: O(n log n)

○ Worst Case: O(n log n)

8
New cards

Quicksort

○ Best Case: O(n log n)

○ Average Case: O(n log n)

○ Worst Case: O(n^2)

9
New cards

Counting Sort

○ Best Case: O(n+k)

○ Average Case: O(n+k)

○ Worst Case: O(n+k)

10
New cards

Radix Sort

○ Best Case: O(n*k)

○ Average Case: O(n*k)

○ Worst Case: O(n*k)

11
New cards

Bucket Sort

○ Best Case: O(n+k)

○ Average Case: O(n+k)

○ Worst Case: O(n^2)

12
New cards

Shell Sort

○ Best Case: O(n log n)

○ Average Case: O(n^(3/2)) or O(n^1.5)

○ Worst Case: O(n^2)