13) An advantage insertion sort has over merge sort is:

Better average time complexity

Better best-case complexity

Better worst-case complexity

14) Merge sort is an example of:

Non-comparative sorting algorithms

Greedy algorithm

Divide and conquer algorithm

Dynamic programming algorithm

15)

Assume you are running a modified version of insertion sort. Every time it performs a swap it logs this by appending the two swapped indexes to a vector which keeps track of all swaps performed. This vector along with the original array are returned to the user. What is the worst-case total space complexity?

O(nLog(n))

O(n^2)

O(n)

O(nLog(n))