Answer:
C. Works by merging two sorted vectors into one larger sorted vector
Explanation:
Merge sort is an efficient, general-purpose, comparison-based sorting algorithm.
Merge sort repeatedly breaks down a list into several sub-lists until each sublist consists of a single element and <em>merging</em> those sub-lists in a manner that results into a sorted list.
You didn’t give any options?
1 - Cropping
2 - Filter
3 - High Resolution
4 - Opaque
Thank you!