Which of the following changes to typical QuickSort improves its performance on average and are generally done in practice GATE CSE 2015

The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we solve previous year question papers for you.
See Our team
Wondering how we keep quality?
Got unsolved questions?

Ask Questions
gate-cse-2015-->View question


Which of the following changes to typical QuickSort improves its performance on average and are generally done in practice. GATE CSE 2015

1) Randomly picking up to make worst case less 
   likely to occur.
2) Calling insertion sort for small sized arrays 
   to reduce recursive calls.
3) QuickSort is tail recursive, so tail call 
   optimizations can be done.
4) A linear time median searching algorithm is used 
   to pick the median, so that the worst case time 
   reduces to O(nLogn)
A=1 and 2
B=2, 3, and 4
C=1, 2 and 3
D=2, 3 and 4 


By:milan-ransingh

Taged users:


Likes:
Be first to like this question

Dislikes:
Be first to dislike this question

Talk about thisDelete|Like|Dislike|


Answers

Answer: (D) Explanation: The probability that more than 4 users are active a time is = (6C5 + 6C6)/26
prajwalamv

Likes:
Be first to like this answer

Dislikes:
Be first to dislike this answer
Talk about this|Once you have earned teacher badge you can edit this questionDelete|Like|Dislike|
------------------------------------

Can you help us to add better answer here? Please see this



Not the answer you're looking for? Browse other questions from this Question paper or ask your own question.

Join eduladder!