Lecture 12: Searching and Sorting Algorithms
0.0(0)
Studied by 0 people
Learn
Practice Test
Spaced Repetition
Match
FlashcardsCard Sorting
1/18
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.
19 Terms
1
New cards
Search Algorithms
method for finding an item or group of items with specific properties within a collection of items that could be implicit or explicit
2
New cards
Searching Algorithms
3
New cards
When does it make sense to sort then search?
4
New cards
Amortized cost — n is len(L)
in some cases, may sort a list once then do many searches
5
New cards
Monkey Sort
6
New cards
Complexity of Bogo Sort
7
New cards
Bubble Sort
8
New cards
Complexity of Bubble Sort
9
New cards
Selection Sort
10
New cards
Loop Invariant
11
New cards
Complexity of Selection Sort
12
New cards
Merge Sort
13
New cards
Complexity of Merging Sublists Step
14
New cards
Merge Sort Algorithm - Recursive
15
New cards
Complexity of Merge Sort
16
New cards
Sorting Summary - n is len(L)
17
New cards
What do Computer Scientists do?
18
New cards
The 3 A’s of Computational Thinking
19
New cards
Aspects of Computational Thinking
Note 
Flashcards (29)