Searching and Sorting

What is an important aspect of computer science that involves finding a value from a list?

• Programming languages

• Searching

• Software development

• Database management

Which of the following is NOT mentioned as an algorithm for searching values from a list?

• Linear

• Binary

• Binary Tree

• Quick Sort

What will the presentation mainly explore?

• The binary tree search algorithm

• The linear search algorithm

• The binary search algorithm

• The complexities of all search algorithms

What does a linear search do in the case where the search item is not found in the list?

• It stops the search immediately.

• It returns the position of the last item.

• It runs through to the end of the list and returns a message indicating the item is not found.

• It restarts the search from the beginning of the list.

At what position does a linear search return the search item if it is found in the list?

• At the position where the item was last added to the list.

• At the position where the item appears first in the list.

• At a random position in the list.

• At the end of the list.

What is the time complexity of the linear search algorithm?

• Constant time

• Quadratic time

• Linear time

• Logarithmic time

In the worst case, how many comparisons will the linear search algorithm make if the list length is n?

• (n+1)/2 comparisons

• n/2 comparisons

• n comparisons

• 1 comparison

On average, how many comparisons will the linear search algorithm make if the list length is n?

• n comparisons

• (n-1)/2 comparisons

• (n+1)/2 comparisons

• 1 comparison

When can the performance of the linear search algorithm be improved?

• If the target item is at the end of the list

• If the target item is in the middle of the list

• If the target item is near the start of the list

• The performance cannot be improved

Compared to other search algorithms, how is the speed of the linear search algorithm generally described?

• Fast

• Moderate

• Slow

• Variable