Sorting and Searching Algorithms Quiz

Which sorting algorithm starts at the first value in the list and compares pairs of values?

• Linear

• Insertion

• Bubble

• Merge

Why is there an inner condition-controlled loop in the Merge sort algorithm?

• To make use of multiple lists/arrays

• To avoid knowing how many swaps are needed

• To run until a condition is met

• To compare all values

What is a similarity between Bubble sort and Insertion sort?

• Both discard half of the item set after each comparison

• Both use a temporary value

• Both start at the second value in the list

• Both are most efficient for large lists

Which search algorithm is suitable for smaller data sets?

• Linear search

• Binary search

• Bubble sort

• Insertion sort

In the Binary search algorithm, what is done if the target value is larger than the selected value?

• Discard right half

• Repeat until the target value is found or not found

• Discard left half

• Check if the selected value matches the target value

What is a difference between Linear search and Binary search?

• Binary search searches each item in sequence after each comparison

• Binary search starts with the middle value

• Linear search is suitable for large data sets

• Linear search starts with the first value

Which sorting algorithm creates a sorted list within the array?

• Insertion sort

• Merge sort

• Linear search

• Bubble sort