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;
10 Cards in this Set
- Front
- Back
|
Insertion Sort Time Complexity |
O(N^2) |
|
|
Selection Sort Time Complexity |
O(N^2) |
|
|
Heap Sort Time Complexity |
O(NlogN) |
|
|
Merge Sort Time Complexity |
O(NlogN) |
|
|
Quicksort Time Complexity |
O(NlogN) |
|
|
Merge Sort |
Divides each list (usually by even/odd index), recursively sorts each part, merges the sorted parts back together |
|
|
Stable Sort |
Maintains the relative order of elements |
|
|
Quick Sort |
chooses a pivot (usually first element), splits rest of the list into a "less", "equal", and "greater list, does this recursively and then merges all the parts back together |
|
|
Priority Queue |
removes elements in priority order, elements are added so that the highest priority element is always first |
|
|
Heap |
each node has value that is equal or lower to that of its parent, each node is added to the left most position in the tree and then sifted up to its correct position |
