List of top Computer Science Questions on Sorting Algorithms

After two complete passes of Bubble Sort on the array [7, 2, 9, 4], what will the new order be?
A. 7
B. 2
C. 4
D. 9
Choose the correct answer from the options given below:
Insertion sort will have a time complexity of ______ in the worst case.
If a list is having 'n' elements, then how many passes 'Selection Sort' will require to sort the list?
The Quicksort and randomized Quicksort procedures differ in:
To perform enqueue and dequeue efficiently on a queue, which of the following operations are required?
A) isEmpty
B) peek
C) isFull
D) update

Given a list numList of n elements and key value K, arrange the following steps for finding the position of the key K in the numList using the binary search algorithm i.e. BinarySearch(numList, key).

 

  1. (A) Calculate mid = (first + last) // 2
  2. (B) SET first = 0, last = n - 1
  3. (C) PRINT "Search unsuccessful"
  4. (D) WHILE first <= last REPEAT
    • IF numList[mid] = key, 
      PRINT "Element found at position", mid+1
      STOP
    • ELSE
      • IF numList[mid] > key, THEN last = mid - 1
      • ELSE first = mid + 1
In binary search, after every pass of the algorithm, the search area:
Arrange the following in order related to bubble sort for a list of elements: Initial list: \[4, -9, 12, 30, 2, 6\] (A) \[4, -9, 12, 30, 2, 6\]
(B) \[-9, 4, 12, 30, 2, 6\]
(C) \[-9, 4, 12, 2, 30, 6\]
(D) \[-9, 4, 12, 2, 6, 30\]
The amount of time an algorithm takes to process a given data can be called its:
For best case, linear search, searches
Which of the following statement(s) is/are true?

A. When two elements map to the same slot in hash table, it is called hashing.
B. Linear search takes a sorted list and divides it in the middle.
C. Modulo division method is a Hashing method.
D. Traversing specifies whether the key is present in the list or not.
E. Binary search takes a sorted/ordered list and divides it in the middle.
The number of swaps made in pass 1 for the following list using Insertion sort is: \[ 9, 8, 14, 2, -8, 5 \]
What will be the status of the list (given below) after pass 2 using Bubble sort? \[ 8, 7, 13, 1, -9, 4 \]
To sort a list having n elements, the Selection sort makes .......... number of passes through the list.
............. sorts a given list of elements by repeatedly comparing the adjacent elements and swapping them if they are unordered.