Quiz on Sorting

#1

In q2 of quiz, please explain 2nd and 3rd points.

#2

Please paste the question here, as I don’t have access to quiz .

#3

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

  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(n Log n)

1 and 2

2, 3 and 4

1, 2 and 3

2, 3 and 4

#4

these links may clear your doubt

in 4th option we can use in theory but not in practice bcoz choose median as pivot in large array has many overhead … these links may clear your doubt

in 4th option we can use in theory but not in practice bcoz choose median as pivot in large array has many overhead …

#5

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.