Big 0 Quiz - Mickey Arnold | Library

1

The _______  sort has a best case run time of O(N).

1

The _______  sort has a best case run time of  O(N*Log2N) and a  worst case run time of O(N2).

1

_______  is the Big O for adding to the front of an array.

1

_______  is the Big O for adding to the front of a linked list.

1

_______  is the Big O for adding an item to a TreeSet.

1

_______  is the Big O for adding an item to a HashSet.

1

The Bubble Sort has a best case run time of  _______  .

1

The Quick Sort has a best case run time of  _______  .

1

The Merge Sort has a best case run time of  _______  .

1

The Quick Sort has a worst case run time of  _______  .

1

The Merge Sort has a worst case run time of  _______  .

1

The Insertion Sort has a best case run time of  _______  .

1

The Insertion Sort has a worst case run time of  _______  .

1

_______  is the Big O for adding to the middle of an array.

1

_______  is the Big O for adding to a binary search tree.

1

_______  is the Big O for adding to the end of an ArrayList.

1

_______  is the Big O for deleting an item from an ArrayList.

1

_______  is the Big O for traversing(accessing all nodes) a binary search tree.

1

_______  is the Big O for searching a binary search tree.

1

_______  is the Big O for deleting an item from a linked list assuming that you know the location of the item to delete.