If Quicksort was the fastest, wouldn't it be called Quickest-Sort?
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
I want to know the usage of QuickSort and randomized QuickSort. Please help me when to use what?
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?