GATE Exam  Aptitude Questions  GATE Syllabus  GATE Result  Mock Test  GATE Preparation
Best Answer to Any Question
Toggle navigation
GATE FORUM
Email or Username
Password
Remember
Login
Register

I forgot my password
Ask a Question
Submit Question
Recent questions tagged bubblesort
Ask a question:
0
votes
1
answer
Why is quicksort better than other sorting algorithms in practice?
In a standard algorithms course we are taught that quicksort is O(nlogn) on average and O(n2) in the worst case. At the same time, other sorting algorithms are studied which are O(nlogn) in the worst case (like mergesort and heapsort), and even linear time in the best case (like bubblesort) but with some additional needs of memory. Also, consider that students learn in basic programming courses that recursion is not really good in general because it could use too much memory, ... Does it have to do with the way memory works in computers? I know that some memories are way faster than others, but I don't know if that's the real reason for this counterintuitive performance (when compared to theoretical estimates).
asked
in
Computer Science
by
anonymous
algorithm
sorting
sortingalgorithm
quicksort
bubblesort
To see more, click for the
full list of questions
or
popular tags
.
The best answer to any question