Searching and sorting algorithms

Question 1 of 10

In the list [9, 4, 7, 2], a linear search for 7 finds it after how many comparisons?

Question 2 of 10

Compare linear search and binary search.

Question 3 of 10

A search that repeatedly halves a sorted list is a ___ search.

Question 4 of 10

Sorting [3, 1, 2] in ascending order gives [1, 2, ___].

Question 5 of 10

A search that checks every item in turn is a ___ search.

Question 6 of 10

Show the passes of bubble sort to sort [5, 1, 4, 2] in ascending order.

Question 7 of 10

Give two everyday examples of sorting and two of searching.

Question 8 of 10

Arranging data from smallest to largest is ___ order.

Question 9 of 10

Which real-life activity is most like a binary search?

Question 10 of 10

In bubble sort, the algorithm repeatedly