CS333 Quiz

What is the big-Oh run time of Merge Sort of n items?

What is the big-Oh run time of Heap Sort on n items?

What is the big-Omega lower bound for comparison based sorting of n items?

What is the worst case big-Oh run time to insert 1 item into an AVL-tree that contains n items?

What is the worst case big-Oh time of binary search on an n item sorted list?

What is the worst case big-Oh time to insert 1 item into a min-heap?

What is the worst case big-Oh time to remove the minimum value from a min-heap?

What is the run time of breadth-first search (in terms of |V| and |E|)?