COP 3502 (Computer Science 1) - Data Structures and Sorting Runtime
Call Kai
Learn
Practice Test
Spaced Repetition
Match
Flashcards
Knowt Play1/50
There's no tags or description
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai |
|---|
No analytics yet
Send a link to your students to track their progress
51 Terms
What is the best-case run-time for Selection Sort?
O(n^2)
What is the average-case run-time for Selection Sort?
O(n^2)
What is the worst-case run-time for Selection Sort?
O(n^2)
Is Selection Sort stable?
Unstable
What is the space complexity of Selection Sort?
O(1)
What is the best-case run-time for Bubble Sort?
O(n)
What is the average-case run-time for Bubble Sort?
O(n^2)
What is the worst-case run-time for Bubble Sort?
O(n^2)
Is Bubble Sort stable?
Stable
What is the space complexity of Bubble Sort?
O(1)
What is the best-case run-time for Insertion Sort?
O(n)
What is the average-case run-time for Insertion Sort?
O(n^2)
What is the worst-case run-time for Insertion Sort?
O(n^2)
Is Insertion Sort stable?
Stable
What is the space complexity of Insertion Sort?
O(1)
What is the best-case run-time for Merge Sort?
O(n log n)
What is the average-case run-time for Merge Sort?
O(n log n)
What is the worst-case run-time for Merge Sort?
O(n log n)
Is Merge Sort stable?
Stable
What is the space complexity of Merge Sort?
O(n)
What is the best-case run-time for Quick Sort?
O(n log n)
What is the average-case run-time for Quick Sort?
O(n log n)
What is the worst-case run-time for Quick Sort?
O(n^2)
Is Quick Sort stable?
Unstable
What is the space complexity of Quick Sort?
O(log n)
What is the best-case run-time for Heapsort?
O(n log n)
What is the average-case run-time for Heapsort?
O(n log n)
What is the worst-case run-time for Heapsort?
O(n log n)
Is Heapsort stable?
Unstable
What is the space complexity of Heapsort?
O(1)
Trie Insert
O(k)
Trie Search
O(k)
Trie Delete
O(k)
AVL Tree Insert
O(log n)
AVL Tree Search
O(log n)
AVL Tree Delete
O(log n)
Binary Heap Insert
O(log n)
Binary Heap Search
O(n)
Binary Heap Delete
O(log n)
BST (Unbalanced) Insert (avg)
O(log n)
BST (Unbalanced) Insert (worst)
O(n)
BST (Unbalanced) Search (avg)
O(log n)
BST (Unbalanced) Search (worst)
O(n)
BST (Unbalanced) Delete (avg)
O(n)
BST (Unbalanced) Delete (worst)
O(n)
Hash Table Insert (avg)
O(1)
Hash Table Insert (worst)
O(n)
Hash Table Search (avg)
O(1)
Hash Table Search (worst)
O(n)
Hash Table Delete (avg)
O(1)
Hash Table Delete (worst)
O(n)
