top button
Flag Notify
    Connect to us
      Facebook Login
      Site Registration

Facebook Login
Site Registration

Why quicksort is called quick though it is not the fastest?

+3 votes
489 views
Why quicksort is called quick though it is not the fastest?
posted Nov 12, 2014 by anonymous

Share this question
Facebook Share Button Twitter Share Button LinkedIn Share Button
Nice catch :) never thought about this

2 Answers

0 votes

If Quicksort was the fastest, wouldn't it be called Quickest-Sort?

answer Nov 12, 2014 by Ronak Jain
0 votes

Agree with what Ronak has said, but the answer lies in the history which is based on the paper of Tony Hoare (1962) which was about a sorting algorithm which was quicker than the other so he published a paper called Quicksort.

Paper was http://comjnl.oxfordjournals.org/content/5/1/10

answer Nov 12, 2014 by Tapesh Kulkarni
Similar Questions
+1 vote

I want to know the usage of QuickSort and randomized QuickSort.
Please help me when to use what?

0 votes
for(i=0;i<n;i++)
  for(j=0;j<n;j++)
     for(k=0;k<n;k++)
        C[i][j]+=A[i][k]*B[k][j];

In this algorithm, there are 6 combinations of loops : the one given above is ijk. The others are ikj,jki,jik,kij and kji. Which one executes the fastest and why?

Contact Us
+91 9880187415
sales@queryhome.net
support@queryhome.net
#280, 3rd floor, 5th Main
6th Sector, HSR Layout
Bangalore-560102
Karnataka INDIA.
QUERY HOME
...