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;
16 Cards in this Set
- Front
- Back
|
Linear search
|
O(n)
|
|
|
Traversing a binary tree
|
O(n)
|
|
|
Binary Search of a sorted array
|
O(log n)
|
|
|
Binary Search of a Binary Search Tree (fairly balanced)
|
O(log n)
|
|
|
Inserting a new node in a Binary Search Tree
|
O(log n)
|
|
|
Number of merges performed in a Merge Sort
|
O(log n)
|
|
|
Bubble Sort
|
O(n²)
|
|
|
Selection Sort
|
O(n²)
|
|
|
Insertion Sort
|
O(n²)
|
|
|
Matrix Multiplication
|
O(n³)
|
|
|
Merge Sort
|
O(n log n)
|
|
|
Binary Tree Sort
|
O(n log n)
|
|
|
Quick Sort
|
O(n log n)
|
|
|
Heap Sort
|
O(n log n)
|
|
|
Recursive Fibonacci Sequence method
|
O(2^n)
|
|
|
Tower of Hanoi solution
|
O(2^n)
|
