Library

Big 0 Quiz

By Mickey Arnold
Last updated 10 months ago
20 Questions
The _______ sort has a best case run time of O(N).
The _______ sort has a best case run time of O(N*Log2N) and a worst case run time of O(N2).
_______ is the Big O for adding to the front of an array.
_______ is the Big O for adding to the front of a linked list.
_______ is the Big O for adding an item to a TreeSet.
_______ is the Big O for adding an item to a HashSet.
The Bubble Sort has a best case run time of _______ .
The Quick Sort has a best case run time of _______ .
The Merge Sort has a best case run time of _______ .
The Quick Sort has a worst case run time of _______ .
The Merge Sort has a worst case run time of _______ .
The Insertion Sort has a best case run time of _______ .
The Insertion Sort has a worst case run time of _______ .
_______ is the Big O for adding to the middle of an array.
_______ is the Big O for adding to a binary search tree.
_______ is the Big O for adding to the end of an ArrayList.
_______ is the Big O for deleting an item from an ArrayList.
_______ is the Big O for traversing(accessing all nodes) a binary search tree.
_______ is the Big O for searching a binary search tree.
_______ is the Big O for deleting an item from a linked list assuming that you know the location of the item to delete.