Search Algorithms Quiz

What is a drawback of merge sort?

• Requires additional memory

• Adds numbers

• Multiplies numbers

• Divides numbers

What is the main purpose of insertion sort?

• To sort a list

• To add numbers

• To multiply numbers

• To divide numbers

What is the purpose of the function calling itself recursively?

• To sort both halves.

• To find the midpoint.

• To check if the array is empty.

• To split the array.

What do the following two while loops account for?

• Any remaining elements in either half.

• Finding the midpoint.

• Splitting the array.

• Checking if the array is sorted.

What is the purpose of the explanation section?

• To explain each line of the Python implementation.

• To provide historical context.

• To describe chemical processes.

• To solve mathematical equations.

What is the use of the 'return' statement in the function?

• To return the sorted array.

• To find the midpoint.

• To split the array.

• To check if the array is sorted.

What is a practical example of using binary search?

• Finding a specific name in a list of unsorted attendees

• Searching for a word in a dictionary

• Sorting a small list of scores

• Inserting new entries into a sorted list

When is insertion sort most efficient?

• For large datasets

• When the dataset is already mostly sorted

• For very small datasets

• When the list is large and sorted

Which algorithm is used for fast search times in large sorted lists?

• Binary search

• Linear search

• Bubble sort

• Insertion sort

When is Merge Sort best used?

• For small datasets

• For large datasets where stable sorting is required

• For unsorted data

• For quick sorting