which sorting algorithm is the most efficiency? look at the description for the options.

Question

•Bucket sort.
•Bubble sort.
•Insertion sort.
•Selection sort.
•Heap sort.
•Merge sort.

Answer 1

No Quick sort?

Answer 2

It is certainly among the most efficient in time but also space complexity. If you want the exact the solution look at this:

http://quiz.geeksforgeeks.org/time-complexities-of-all-sorting-algorithms/

And if you don't know what time and space complexity is :

https://www.hackerearth.com/practice/basic-programming/complexity-analysis/time-and-space-complexity/tutorial/

Answer 3

Quicksort is better for 'randomized' data. The more sorted it is beforehand, the slower the quicksort will be.

Answer 4

is quick sort the most efficiency?

Answer 5

The Landau expression for time complexity does not tell the whole story though. Even if the expected runtime of two algorithms is in θ(n log n), one can be faster by a constant, but huge, factor.

In most cases quicksort will be much faster than heap or mergesort for example. If you have reason to believe your data sets you up for a bad case (does not happen all too often), you should consider using one of the other algorithms though.

Answer 6

From the options, merge sort is better for generic purposes. In specific situations, it will depend on the data.