1. What is the average case time complexity of merge sort?
2. What will be the output of the given Java code?
import java.util.Arrays;
public class SortExample
{
public static void main(String[] args)
{
int[] arr = {10,7,9,5,8,4};
Arrays.sort(arr, 1, 3);
System.out.printf(Arrays.toString(arr));
}
}
import java.util.Arrays;
public class SortExample
{
public static void main(String[] args)
{
int[] arr = {10,7,9,5,8,4};
Arrays.sort(arr, 1, 3);
System.out.printf(Arrays.toString(arr));
}
}3. Quick Sort can be categorized into which of the following?
4. Which one of the following is false?
5. For the best case input, the running time of an insertion sort algorithm is?
6. Which of the following is true?
7. What is the auxiliary space requirement of bogosort?
8. Strand sort is a stable sorting algorithm.
9. Auxiliary space used by comb sort is . . . . . . . .
Read More Section(Sorting Algorithms)
Each Section contains maximum 100 MCQs question on Sorting Algorithms. To get more questions visit other sections.