April 18, 2024GATE 2001Question 14 Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using […]
April 18, 2024Question 10667 – SortingIf we use Radix Sort to sort n integers in the range [nk/2, nk], for some k>0 which is independent of n, the time taken would […]
April 18, 2024Question 10618 – SortingLet P be a quicksort program to sort numbers in ascending order. Let t1 and t2 be the time taken by the program for the inputs […]
April 19, 2024Question 8476 – ArraysConsider the list of numbers 1, 2, 3, …, 1000 is stored in a[0..999]. What will be the total number of comparisons to search x = […]