The best algorithm used for pipelining is…?ans.Merge sortQuick sortSmallHarshThis Question Is Marked For Review Previous Remove From Review Next

The question seems to be asking for the best algorithm used for pipelining. However, the options provided (Merge sort, Quick sort, Small, Harsh) are not clear in the context of pipelining.

Pipelining is a technique used in advanced microprocessors where the microprocessor begins executing a second instruction before the first has been completed. That's why pipelining increases the overall instruction throughput of the microprocessor.

In the context of sorting algorithms, both Merge Sort and Quick Sort have their advantages and can be efficient depending on the specific requirements of the task.

• Merge Sort is a stable sort which means that the same element in an array maintain their original positions with respect to each other. The worst case time complexity of Merge Sort is O(nLogn) in all 3 cases (worst, average and best) as merge sort always divides the array into two halves and takes linear time to merge two halves.

• Quick Sort is a fast, in-place sorting algorithm that in practice is faster than Merge Sort when sorting arrays. However, it is not a stable sort, and its worst-case time complexity is O(n^2), but this scenario is quite rare.

Without more context, it's hard to definitively say which is "best" for pipelining. It would depend on the specific requirements of the task.