Alsager - A2 - 2.3.4 - Searching Algorithms

What is the primary purpose of searching algorithms?

• To sort a list of elements

• To find a specified element within a data structure

• To delete elements from a data structure

• To merge multiple data structures

On what type of data can the binary search algorithm be applied?

• Unsorted data

• Sorted data

• Multidimensional data

• Encrypted data

What happens to the unwanted half of the data in a binary search algorithm?

• It is sorted again

• It is returned as the result

• It is discarded

• It is stored for later use

What is the time complexity of binary search?

• O(n)

• O(n^2)

• O(log n)

• O(1)

What does the binary search algorithm do when the low value is greater than the high value?

• It continues searching until it finds the desired data

• It resets the values and starts over

• It returns "Not found in data" and terminates

• It randomly selects a new position to check

What is the time complexity of a linear search algorithm?

• O(log n)

• O(n^2)

• O(n)

• O(1)

Why is linear search considered inefficient?

• Because it requires the data to be sorted

• Because it has a time complexity of O(n^2)

• Because it checks each element one by one

• Because it is difficult to implement

What is a major advantage of linear search in terms of implementation?

• It is very efficient

• It requires the data to be sorted

• It is easy to implement

• It has a time complexity of O(log n)

What is demonstrated about the efficiency of the algorithm when searching for the letter 'R' in the first 20 characters of the alphabet?

• The algorithm is more efficient than binary search.

• The algorithm is equally efficient as binary search.

• The algorithm is less efficient than binary search.

• The efficiency of the algorithm cannot be determined from the example.