If you needed to sort an array with 10,000 items in the least amount of time, which sorting algorithm would you use?

Question

Guest

Social Studies

2 October, 13:05

If you needed to sort an array with 10,000 items in the least amount of time, which sorting algorithm would you use?

+4

Answers (1)

Know the Answer?

Simon · Answer 1

The answer is "Binary Search algorithm".

Explanation:

It is an accurate method, which is used to identify an object from the list of things, that has been sorted. It operates by splitting a section of the list.

It includes the element twice into half, until after you have reduced all the potential targets to only one. This algorithm works with O (n * log (n)) efficiency, that's why it is used in the array sorting, it also consumes less time.