Q. Which of the below mentioned sorting algorithms are not stable?

View solution

Q. A pivot element to partition unsorted list is used in

View solution

Q. Which of the following algorithm does not divide the list −

View solution

Q. Time required to merge two sorted lists of size m and n, is

View solution

Q. Quick sort algorithm is an example of

View solution

Q. Quick sort running time depends on the selection of

View solution

Q. Which one of the below is not divide and conquer approach?

View solution

Q. Which of the following searching techniques do not require the data to be in sorted form

View solution

Q. Which of the below given sorting techniques has highest best-case runtime complexity

View solution

Q. How many swaps are required to sort the given array using bubble sort - { 2, 5, 1, 3, 4} ?

View solution

Q. An adaptive sorting algorithm −

View solution

Q. The following sorting algorithms maintain two sub-lists, one sorted and one to be sorted −

View solution

Q. The worst case complexity of binary search matches with −

View solution

Q. The number of comparisons done by sequential search is ………………

View solution

Q. In ……………, search start at the beginning of the list and check every element in the list.

View solution

Q. State True or False.

i) Binary search is used for searching in a sorted array.

ii) The time complexity of binary search is O(logn).

View solution

Q. Which of the following is not the internal sort?

View solution

Q. In general, the binary search method needs no more than ……………. comparisons.

View solution

Q. The Worst case occur in linear search algorithm when

View solution

Q. The Average case occur in linear search algorithm

View solution