1. What is the worst case time complexity of the Quick sort?
2. Which of the following is a comparison based sort?
3. What is the worst case time complexity of library sort?
4. Choose the incorrect statement about merge sort from the following?
5. What will be the output of the given Java code?
import java.util.Arrays;
public class SortExample
{
public static void main(String[] args)
{
// Our arr contains 8 elements
int[] arr = {10,7,9,5,8,4};
Arrays.sort(arr);
System.out.printf(Arrays.toString(arr));
}
}
import java.util.Arrays;
public class SortExample
{
public static void main(String[] args)
{
// Our arr contains 8 elements
int[] arr = {10,7,9,5,8,4};
Arrays.sort(arr);
System.out.printf(Arrays.toString(arr));
}
}6. What is the worst case time complexity of cycle sort?
7. The gap value after 3 iterations in an array with 6 elements will be . . . . . . . .
8. Which one of the following is a variation of Heap sort?
9. Heap sort is an implementation of . . . . . . . . using a descending priority queue.
10. Shell sort algorithm is an example of?
Read More Section(Sorting Algorithms)
Each Section contains maximum 100 MCQs question on Sorting Algorithms. To get more questions visit other sections.