Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Searching, Sorting and Hashing Sorting
Map the following statements regarding quick sort with true(T) or false(F) respectively.
S1: Quick sort is an in-place sorting algorithm.
S2: Quick sort is stable.
S3: Quick sort performs best when numbers are sorted or almost sorted.
S4: The expected running time of quick sort, using randomized-partition is O(nlogn).
S5: It is an example of dynamic programming design technique.1
TFFFF
2
TTFTT
3
TFFTF
4
FTFTF