Pivot in Quick sort can be selected as
A) always first element
B) always last element
C) always middle index element
D) randomly selected element
Correct Answer:
Verified
Q15: Which of following is NOT A WAY
Q16: Which is the sorting algorithm in below
Q17: The odd-even transposition algorithm sorts n elements
Q18: What is TRUE about SHELL SORT
A)moves elements
Q19: Which is the fastest sorting algorithm
A)bubble sort
B)odd-even
Q20: Quicksort's performance is greatly affected by the
Q22: Quick sort uses Recursive Decomposition
Q23: In first step of parallelizing quick sort
Q24: In Binary tree representation created by execution
Q25: What is the worst case time complexity
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents