Q. ___________ is a method of arranging keys in a file in the ascending or descending order.

View solution

Q. Library sort was first published in___________.

View solution

Q. Sorting makes handling of ______ in a file easier.

View solution

Q. What refers to a simple sorting algorithm?

View solution

Q. _________is efficient for data sets which are already substantially sorted. The time complexity is O(n + d), where d is the number of inversions.

View solution

Q. Compared to insertion sort, _________ are more advanced algorithms.

View solution

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