Ask Question
17 January, 08:54

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

+5
Answers (1)
  1. 17 January, 09:48
    0
    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.
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “If you needed to sort an array with 10,000 items in the least amount of time, which sorting algorithm would you use? ...” in 📘 Social Studies if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers