Python Questions (Insertion and Merge Sort)

What type of sorting algorithm is Merge Sort?

• Linear Sort
  

• Insertion Sort

• Divide and Conquer

• Bubble Sort

In Merge Sort, the main idea is to:

• Swap adjacent elements
  

• Divide the list into sublists and merge them

• Find the smallest element and move it to the beginning

• Compare each element with all others

Which step is not part of the Merge Sort algorithm?

• Merge

• Divide

• Conquer

• Sort

Insertion Sort works by:

• Dividing the list into sublists

• Repeatedly selecting the largest element

• Comparing adjacent elements and swapping them if necessary

• Inserting elements into their correct position in a sorted subarray

In Insertion Sort, the sorted portion of the array starts with how many elements?

• 0

• 1

• All elements

• Half of the array

Insertion Sort is efficient for:

• Large lists with random order

• Large lists already in sorted order

• Lists with only one element

• Small lists with random order

Which sorting algorithm typically has better average-case and worst-case performance?

• Merge Sort

• Insertion Sort

• Both have the same performance

• It depends on the input size

In terms of time complexity, which sorting algorithm is more efficient for larger lists?

• Merge Sort

• Insertion Sort

• Both have the same efficiency

• Neither is efficient for larger lists

Which sorting algorithm requires extra space for merging?

• Merge Sort
  

• Insertion Sort

• Both

• Neither

Insertion Sort is considered efficient for which type of small lists?

• Lists with reversed order

• Lists with random order

• Lists already sorted in ascending order

• Lists with all the same elements