1. Which two sorting algorithms typically involve recursion? (1 point)

Question

insertion sort and quick sort
bubble sort and merge sort
merge sort and quick sort
insertion sort and bubble sort
I think it is merge sort and quick sort because the implementation of merge sort is recursive and the quick sort algorithm is recursively applied.

Answer 1

1. Which two sorting algorithms typically involve recursion?
Merge Sort and Quick Sort
2. Which sorting algorithm continuously divides an array into halves until single...
Merge Sort
3. A poker player is dealt a hand of cards that has...
Insertion Sort
4. Ten people are standing in a line, waiting to be sorted...
quick sort
5. An algorithm is designed to work on an array by starting...
bubble sort
6. What is the average-case time complexity of quick sort?
O (n log n)
7. What is the worst-case time complexity of bubble sort?
O (n^2)
8. What is the average-case time complexity of merge sort?
O (n log n)
9. What is the average-case time complexity of insertion sort?
O (n^2)
10. A programmer creates an algorith that sorts an array. It works...
O (n^2)

Answer 2

correct