Chapt 14

The worst case complexity is ______ when compared with the average case complexity of a binary search algorithm.

• Equal

• Greater

• Less

• None o these

The complexity of binary search algorithm is

• O(n)

• O(n^2)

• O(nlogn)

• O(logn)

Which of the following cases occurs when searching an array using linear search the value to be searched is equal to the first element of the array?

• Worse Case

• Average Case

• Best case

• Amortized Case

A card game player arranges his cards and picks them one by one. With which sorting technique can you compare this example?

• Bubble Sort

• Selection Sort

• Merge Sort

• Insertion Sort

Which of the following techniques deals with sorting the data stored in the computer’s memory?

• Insertion Sort

• Internal sort

• External Sort

• Radix Sort

In which sorting, consecutive adjacent pairs of elements in the array are compared with each other?

• Bubble Sort

• Selection Sort

• Merge Sort

• Radix Sort

Which term means sorting the two sub-arrays recursively using merge sort?

• Divide

• Conquer

• Combine

• all of the above

Which sorting algorithm sorts by moving the current data element past the already sorted values and repeatedly interchanging it with the preceding value until it is in its correct place?

• Insertion Sort

• Internal Sort

• External Sort

• Radix Sort

Which algorithm uses the divide, conquer, and combine algorithmic paradigm?

• Selection

• insertion

• merge

• Radix

Quick sort is faster than

• Selection

• insertion

• bubble

• all of the above