Algorithms and data structures

Question 1 of 10

Pushing 1, 2, 3 onto a stack and popping once returns

Question 2 of 10

In the worst case, how many comparisons does a linear search of n items make?

Question 3 of 10

Bubble sort repeatedly

Question 4 of 10

The worst-case time complexity of bubble sort is

Question 5 of 10

A data structure that follows Last In, First Out is a

Question 6 of 10

Which data structure removes items in the same order they were added?

Question 7 of 10

Linear search checks items

Question 8 of 10

The maximum number of comparisons a binary search needs for 1,000 sorted items is about

Question 9 of 10

Adding an item to the top of a stack is called

Question 10 of 10

The time complexity of binary search is