Time

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

1/17

encourage image

There's no tags or description

Looks like no tags are added yet.

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

No analytics yet

Send a link to your students to track their progress

18 Terms

1
New cards

Bubble Sort

Best Case: O(n), Average Case: O(n²), Worst Case: O(n²)

2
New cards

Selection Sort

Best Case: O(n²), Average Case: O(n²), Worst Case: O(n²)

3
New cards

Insertion Sort

Best Case: O(n), Average Case: O(n²), Worst Case: O(n²)

4
New cards

Merge Sort

Best Case: O(n log n), Average Case: O(n log n), Worst Case: O(n log n)

5
New cards

Quick Sort

Best Case: O(n log n), Average Case: O(n log n), Worst Case: O(n²)

6
New cards

Linear Search

Best Case: O(1), Average Case: O(n), Worst Case: O(n)

7
New cards

Binary Search

Best Case: O(1), Average Case: O(log n), Worst Case: O(log n)

8
New cards

Linked List Access

Best Case: O(1), Average Case: O(n), Worst Case: O(n)

9
New cards

Linked List Search

Best Case: O(1), Average Case: O(n), Worst Case: O(n)

10
New cards

Linked List Insert

Best Case: O(1), Average Case: O(n), Worst Case: O(n)

11
New cards

Linked List Delete

Best Case: O(1), Average Case: O(n), Worst Case: O(n)

12
New cards

Binary Tree Access

Best Case: O(log n), Average Case: O(log n), Worst Case: O(n)

13
New cards

Binary Tree Search

Best Case: O(log n), Average Case: O(log n), Worst Case: O(n)

14
New cards

Binary Tree Insert

Best Case: O(log n), Average Case: O(log n), Worst Case: O(n)

15
New cards

Binary Tree Delete

Best Case: O(log n), Average Case: O(log n), Worst Case: O(n)

16
New cards

Hash Table Search

Best Case: O(1), Average Case: O(1), Worst Case: O(n)

17
New cards

Hash Table Insert

Best Case: O(1), Average Case: O(1), Worst Case: O(n)

18
New cards

Hash Table Delete

Best Case: O(1), Average Case: O(1), Worst Case: O(n)