Reading...
Play button
Play button
Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
12 Cards in this Set
- Front
- Back
|
Big O of Insertion Sort
|
n^2
|
|
|
Big O of Merge Sort
|
n log n
|
|
|
Big O of bubble sort
|
n^2
|
|
|
Big O of quick sort
|
n log n
|
|
|
Big O of Linear Search
|
n
|
|
|
Big O of binary search
|
log (n)
|
|
|
How does Binary Search Work?
|
A sorted list compares a key value to the middle of the array (or new subarray) over and over
|
|
|
How does quick sort work?
|
Pick a pivot and recursively pick more pivots sorting things in to lists less than and grater than the pivot
|
|
|
How does Merge Sort work?
|
Breaks list up to pieces, rebuilds in to bigger and bigger matrices by comparing the first element of every smaller matrix to one another and inserting them in to bigger and bigger matrices
|
|
|
How does bubble sort work?
|
compares across bubbles and pushes back
|
|
|
How does Insertion Sort Work?
|
Pulls values out of a list and compares the values less than it to the values greater than it, inserting it between those values
|
|
|
How does Linear Search work?
|
moves through list one by one in order
|
