Which of the following is a common sorting algorithm?

Merge sort is a well-known sorting algorithm that follows the divide-and-conquer paradigm. It works by dividing an array (or list) into two halves, recursively sorting each half, and then merging the sorted halves back together. This approach ensures that the result is a fully sorted array. Merge sort is particularly effective for larger datasets because of its O(n log n) average and worst-case time complexity, making it efficient compared to simpler algorithms such as bubble sort or insertion sort, especially when working with large input sizes.

In contrast, binary search and linear search are not sorting algorithms; they are search algorithms used to locate an item in a sorted or unsorted array. Stack sort is less commonly discussed as it typically refers to a sorting method that uses a stack data structure, but it is not one of the standard sorting algorithms like merge sort. Therefore, merge sort is the best answer because it is explicitly designed for sorting data.