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;
33 Cards in this Set
- Front
- Back
|
Array access |
O(1) |
|
|
Array search |
O(n) |
|
|
Array insert |
O(n) Amortized insertion at end O(1) |
|
|
Array delete |
O(n) |
|
|
Stack access |
O(n) |
|
|
Stack insert |
O(1) |
|
|
Stack search |
O(n) |
|
|
Stack delete |
O(1) |
|
|
Singly Linked List access |
O(n) |
|
|
Singly Linked List search |
O(n) |
|
|
Singly Linked List insert |
O(1) |
|
|
Singly Linked List delete |
O(1) |
|
|
Doubly Linked List access |
O(n) |
|
|
Doubly Linked List search |
O(n) |
|
|
Doubly Linked List insert |
O(1) |
|
|
Doubly Linked List delete |
O(1) |
|
|
Hash Table search |
O(n) Expected O(1) with good hashing function |
|
|
Hash Table insert |
O(n) Expected O(1) with good hashing function |
|
|
Hash Table delete |
O(n) Expected O(1) with good hashing function |
|
|
BST access |
O(n) Expected O(logn) with balanced tree |
|
|
BST search |
O(n) Expected O(logn) with balanced tree |
|
|
BST insert |
O(n) Expected O(logn) with balanced tree |
|
|
BST delete |
O(n) Expected O(logn) with balanced tree |
|
|
RB Tree access |
O(logn) |
|
|
RB Tree search |
O(logn) |
|
|
RB Tree insert |
O(logn) |
|
|
RB Tree delete |
O(logn) |
|
|
Quicksort |
O(n^2) Expected O(nlogn) - randomize array before sort |
|
|
Mergesort |
O(nlogn) |
|
|
Heapsort |
O(nlogn) |
|
|
Bubblesort |
O(n^2) |
|
|
Insertionsort |
O(n^2) |
|
|
Selectionsort |
O(n^2) |
