Grade 10 Linear Search and Sorting Quiz

What is the primary purpose of the linear search algorithm?

• To sort elements

• To find an element in a list

• To merge two lists

• To delete an element

What is one disadvantage of using linear search?

• It requires extra space

• It is not easy to implement

• It is inefficient for large datasets

• It can only be used on sorted data

In what scenario is linear search particularly useful?

• When the data is sorted

• When dealing with small datasets

• When needing to find multiple elements

• When searching in a binary tree

What card would you need to search for, for the best-case scenario to occur?

• 10

• 6

• 7

• 8

What card would you need to search for, for the worst-case scenario to occur?

• 10

• 6

• 7

• 8

How many comparisons would it take to work out that a card wasn’t in the set of cards?

• 10

• 6

• 7

• 8

When carrying out the linear search, does the data need to be ordered?

• No

• Yes

Bubble Sort is an example of a sorting algorithm that:

• Uses a divide-and-conquer strategy

• Uses dynamic programming

• Swaps adjacent elements directly

• Only works with integers

Read the description below and then select which algorithm it is referring to: “Move through a list repeatedly, comparing items next to each other and swapping them if they are in the wrong order.”

• Bubble sort

• Merge sort

• Insertion sort

• Linear search

Which algorithm is slowest on large datasets?

• Bubble Sort

• Binary Search

• Linear Search

• Merge sort