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 algorithm
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
0
votes
1
answer
How to come up with the runtime of algorithms?
bigO notations like O(n) time taken by an algorithm, how do you calculate it for a given algorithm.
asked
in
Computer Science
by
anonymous
algorithm
algorithmanalysis
runtimeanalysis
bigonotation
0
votes
1
answer
Big O notation and Worst case Analysis of an Algorithm?
in this we will ans the following question Is bigO notation a tool to do best, worst, & average case analysis of an algorithm? Big O for worstcase running time and Ω is for the bestcase, but why is Ω used in worst case sometimes? What is the difference between Big O notation and Worst case Analysis of an Algorithm? As for my understanding both will give upper bound of any given function. Please explain the difference. There is a common misconception that BigO means worstcase, BigOmega means bestcase, BigTheta means averagecase. How do O and Ω relate to worst and best case?
asked
in
data structures and algorithms
by
anonymous
algorithm
datastructures
asymptoticcomplexity
bigo
bigonotation
To see more, click for the
full list of questions
or
popular tags
.
The best answer to any question