Insertion sort

12 questions

1. Which of these best describes the process of splitting in merge sort?
2. What happens to unsorted sublists during merging in merge sort?
3. What is the main advantage of merge sort compared to bubble sort?
4. Which of these is a characteristic of a divide and conquer algorithm?
5. Why does merge sort require extra memory?
6. Which of these is NOT true about merge sort?
7. What are the two parts of a list in an insertion sort?
8. During an insertion sort, where is the current item placed?
9. What is one real-world example of using an insertion sort?
10. Why might insertion sort be faster than other algorithms in some cases?
11. Place the steps of an insertion sort in the correct order:
12. What happens if the current item is smaller than all items in the sorted sublist?

License: OGL