Divide and conquer

   An unordered list contains n distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is:

• theta(n log n)

• theta(n)

• theta(log n)

• theta(1)

Which of the following is a Divide and Conquer algorithm?

• Bubble Sort

• Selection Sort

• Heap Sort

• Merge Sort

Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using randomized quicksort?

• O(n)

• (nlogn)

• O(n^2)

• O(n!)

Which of the following sorting algorithms has the lowest worst-case complexity

• Merge Sort

• Bubble sort

• Quick sort

• Selection sort

Which of the following sorting algorithms has the lowest worst-case complexity

• Merge Sort

• Bubble sort

• Quick sort

• Selection sort

In quick sort sort, for sorting n elements, the (n/4)th smallest element is selected as pivot using an O(n) time algorithm. What is the worst case time complexity of the quick sort

• theta(n)

• theta(nlogn)

• theta(n^2)

• theta(n^2 logn)

Which of the following methods is the most effective for picking the pivot element?

• first element

• last element

• median-of-three partitioning

• random element

Find the pivot element from the given input using median-of-three partitioning method. 8, 1, 4, 9, 6, 3, 5, 2, 7, 0.

• 8

• 7

• 9

• 6

How many sub arrays does the quick sort algorithm divide the entire array into?

• one

• two

• three

• four

Quick sort uses join operation rather than merge operation.

• true

• false