Better Students Ask More Questions.
What is the fastest sorting algorithm in computer science?we have different kinds of...
2 Answers | add yours
Any algorithm that has some data entry has 3 cases:
These cases represent their performance and the evolution of their performance depending on the number of data entry.
For instance,for 10 items to sort, it can not be noted the difference in time execution, between several algorithms. Instead, for 10 000 elements to sort, it can be seen the difference between algorithms running in time. The writing is simple with Bubble Sort sorting, but unfortunately it is slow.
As we talk about fast algorithms, Quicksort , Mergesort and Heapsort, could be considered.
Posted by giorgiana1976 on January 17, 2010 at 8:12 PM (Answer #1)
O(nlogn) is the best known complexity(worst case) i.e heap sort.
Posted by kesnitw on June 10, 2011 at 12:16 AM (Answer #2)
Related QuestionsSee all »
Join to answer this question
Join a community of thousands of dedicated teachers and students.