Q. In abstract terms, each iteration of insertion sort removes an element from the input data and
then inserts it into the correct position in the _________ that is already sorted.

View solution

Q. An array sorted in the reverse order is the __________ case input.

View solution

Q. ___________ is a simple sorting technique to sort a list of elements.

View solution

Q. The running time of heap sort is __________.

View solution

Q. There is one to one correspondence between elements of the _________of the tree.

View solution

Q. To perform the heap sort, you need to create a tree with all nodes greater than their __________.

View solution

Q. What is one of the fastest and simplest sorting algorithms?

View solution

Q. The most-used orders are___________.

View solution

Q. __________ refers to the set of all possible solutions to a problem.

View solution

Q. Brute-force search, commonly known as_________.

View solution

Q. Searching refers to an operation of finding the location of an item in a_______.

View solution

Q. When the records are stored in __________ or any secondary storage, then the searching is known as external searching.

View solution

Q. Which is the easiest and least efficient searching technique?

View solution

Q. The average searching time for Fibonacci search is__________.

View solution

Q. Fibonaccian search, also referred to as Fibonacci search, is a ________algorithm for searching a sorted array by narrowing possible locations to progressively smaller intervals.

View solution

Q. At most, how many comparisons are required to search a sorted vector of 1023 elements using the binary search algorithm?

View solution

Q. Which of the following is an example of in-place algorithm?

View solution

Q. The average case of quick sort has order

View solution

Q. Which sorting algorithm is the best if the list is already in order?

View solution

Q. The number of comparisons required to sort 5 numbers in ascending order using bubble sort is

View solution