Big 0 Quiz

Last updated over 2 years ago

20 Nsɛmmisa

Laabri

Big 0 Quiz

Last updated over 2 years ago

20 Nsɛmmisa

Asemmisa {{asɛmmisaAhyɛnsode}}

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

Asemmisa {{asɛmmisaAhyɛnsode}}

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

Asemmisa {{asɛmmisaAhyɛnsode}}

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

Asemmisa {{asɛmmisaAhyɛnsode}}

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

Asemmisa {{asɛmmisaAhyɛnsode}}

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

Asemmisa {{asɛmmisaAhyɛnsode}}

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

Asemmisa {{asɛmmisaAhyɛnsode}}

The Bubble Sort has a best case run time of .

Asemmisa {{asɛmmisaAhyɛnsode}}

The Quick Sort has a best case run time of .

Asemmisa {{asɛmmisaAhyɛnsode}}

The Merge Sort has a best case run time of .

Asemmisa {{asɛmmisaAhyɛnsode}}

10.

The Quick Sort has a worst case run time of .

Asemmisa {{asɛmmisaAhyɛnsode}}

11.

The Merge Sort has a worst case run time of .

Asemmisa {{asɛmmisaAhyɛnsode}}

12.

The Insertion Sort has a best case run time of .

Asemmisa {{asɛmmisaAhyɛnsode}}

13.

The Insertion Sort has a worst case run time of .

Asemmisa {{asɛmmisaAhyɛnsode}}

14.

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

Asemmisa {{asɛmmisaAhyɛnsode}}

15.

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

Asemmisa {{asɛmmisaAhyɛnsode}}

16.

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

Asemmisa {{asɛmmisaAhyɛnsode}}

17.

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

Asemmisa {{asɛmmisaAhyɛnsode}}

18.

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

Asemmisa {{asɛmmisaAhyɛnsode}}

19.

is the Big O for searching a binary search tree.

Asemmisa {{asɛmmisaAhyɛnsode}}

20.

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

Asemmisa {{asɛmmisaAhyɛnsode}}

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

Asemmisa {{asɛmmisaAhyɛnsode}}

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

Asemmisa {{asɛmmisaAhyɛnsode}}

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

Asemmisa {{asɛmmisaAhyɛnsode}}

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

Asemmisa {{asɛmmisaAhyɛnsode}}

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

Asemmisa {{asɛmmisaAhyɛnsode}}

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

Asemmisa {{asɛmmisaAhyɛnsode}}

The Bubble Sort has a best case run time of .

Asemmisa {{asɛmmisaAhyɛnsode}}

The Quick Sort has a best case run time of .

Asemmisa {{asɛmmisaAhyɛnsode}}

The Merge Sort has a best case run time of .

Asemmisa {{asɛmmisaAhyɛnsode}}

10.

The Quick Sort has a worst case run time of .

Asemmisa {{asɛmmisaAhyɛnsode}}

11.

The Merge Sort has a worst case run time of .

Asemmisa {{asɛmmisaAhyɛnsode}}

12.

The Insertion Sort has a best case run time of .

Asemmisa {{asɛmmisaAhyɛnsode}}

13.

The Insertion Sort has a worst case run time of .

Asemmisa {{asɛmmisaAhyɛnsode}}

14.

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

Asemmisa {{asɛmmisaAhyɛnsode}}

15.

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

Asemmisa {{asɛmmisaAhyɛnsode}}

16.

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

Asemmisa {{asɛmmisaAhyɛnsode}}

17.

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

Asemmisa {{asɛmmisaAhyɛnsode}}

18.

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

Asemmisa {{asɛmmisaAhyɛnsode}}

19.

is the Big O for searching a binary search tree.

Asemmisa {{asɛmmisaAhyɛnsode}}

20.

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