Sorting and Searching Algorithms Quiz

What is the first step in the insertion sort algorithm?

• Compare the first two elements.

• Start with the second element and compare it with the first.

• Divide the list into two halves.

• Swap the first and last elements.

In insertion sort, what happens if the current element is smaller than the previous element?

• The current element is swapped with the previous element.

• The current element is left in its place.

• The current element is removed from the list.

• The list is reversed.

What is the main advantage of insertion sort over other sorting algorithms?

• It is the fastest sorting algorithm.

• It is simple and efficient for small data sets.

• It uses less memory.

• It is the most accurate sorting algorithm.

In binary search, what is the prerequisite for the list?

• The list must be sorted.

• The list must contain only integers.

• The list must be in descending order.

• The list must have an even number of elements.

During a binary search, if the target value is less than the middle element, what should be the next step?

• Search the left half of the list.

• Search the right half of the list.

• Search the entire list again.

• Stop the search.

Which of the following is a disadvantage of binary search?

• It is slower than linear search.

• It requires the list to be sorted.

• It uses more memory.

• It cannot find duplicate elements.

In insertion sort, what is the best case scenario for the algorithm?

• The list is already sorted.

• The list is in reverse order.

• The list contains all identical elements.

• The list is empty.

Which of the following is true about insertion sort?

• It is a recursive algorithm.

• It is a comparison-based sorting algorithm.

• It is not stable.

• It requires additional memory.

In binary search, if the target value is greater than the middle element, what should be the next step?

• Search the left half of the list.

• Search the right half of the list.

• Search the entire list again.

• Stop the search.

Which of the following is a characteristic of insertion sort?

• It is a divide and conquer algorithm.

• It is an in-place sorting algorithm.

• It requires a large amount of memory.

• It is not suitable for small data sets.