ONE 6th FORM - Sorting Algorithms: Bubble and Insertion

What is the primary operation performed in a bubble sort algorithm?

• Swapping adjacent elements

• Merging sorted subarrays

• Dividing the array into halves

• Inserting elements into their correct position

Which of the following best describes the insertion sort algorithm?

• It repeatedly finds the minimum element and places it at the beginning

• It builds the final sorted array one item at a time

• It divides the array into two halves and sorts them recursively

• It swaps adjacent elements if they are in the wrong order

What is the average time complexity of bubble sort?

What is the average time complexity of insertion sort?

Which sorting algorithm is generally more efficient for small datasets?

• Bubble sort

• Insertion sort

• Quick sort

• Merge sort

Which of the following statements about sorting stability is true?

• A stable sort maintains the relative order of records with equal keys

• A stable sort changes the relative order of records with equal keys

• Stability is not a concern in sorting algorithms

• Stability only applies to numerical data

Is bubble sort a stable sorting algorithm?

• Yes

• No

Is insertion sort a stable sorting algorithm?

• Yes

• No

Which of the following Python code snippets correctly implements bubble sort?

• ```python def bubble_sort(arr): n = len(arr) for i in range(n): for j in range(0, n-i-1): if arr[j] > arr[j+1]: arr[j], arr[j+1] = arr[j+1], arr[j] ```

• ```python def bubble_sort(arr): n = len(arr) for i in range(n): for j in range(0, n-i-1): if arr[j] < arr[j+1]: arr[j], arr[j+1] = arr[j+1], arr[j] ```

• ```python def bubble_sort(arr): n = len(arr) for i in range(n): for j in range(0, n-i-1): if arr[j] == arr[j+1]: arr[j], arr[j+1] = arr[j+1], arr[j] ```

• ```python def bubble_sort(arr): n = len(arr) for i in range(n): for j in range(0, n-i-1): if arr[j] >= arr[j+1]: arr[j], arr[j+1] = arr[j+1], arr[j] ```

Which of the following Python code snippets correctly implements insertion sort?

• ```python def insertion_sort(arr): for i in range(1, len(arr)): key = arr[i] j = i-1 while j >= 0 and key < arr[j]: arr[j + 1] = arr[j] j -= 1 arr[j + 1] = key ```

• ```python def insertion_sort(arr): for i in range(1, len(arr)): key = arr[i] j = i-1 while j >= 0 and key > arr[j]: arr[j + 1] = arr[j] j -= 1 arr[j + 1] = key ```

• ```python def insertion_sort(arr): for i in range(1, len(arr)): key = arr[i] j = i-1 while j >= 0 and key == arr[j]: arr[j + 1] = arr[j] j -= 1 arr[j + 1] = key ```

• ```python def insertion_sort(arr): for i in range(1, len(arr)): key = arr[i] j = i-1 while j >= 0 and key <= arr[j]: arr[j + 1] = arr[j] j -= 1 arr[j + 1] = key ```