Data Structure · all questions

Sorting Algorithms
practice.

Practice every MCQ with options. Use Show answers when you want the correct option and solution.

509

Questions

26/26

Page

Pick an option on a question to see the right answer and solution.

Q501

What is the average case time complexity of merge sort?

Select an option to see the answer and solution.

Q502

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)); 
	} 
}

Select an option to see the answer and solution.

Q503

Quick Sort can be categorized into which of the following?

Select an option to see the answer and solution.

Q504

Which one of the following is false?

Select an option to see the answer and solution.

Q505

For the best case input, the running time of an insertion sort algorithm is?

Select an option to see the answer and solution.

Q506

Which of the following is true?

Select an option to see the answer and solution.

Q507

What is the auxiliary space requirement of bogosort?

Select an option to see the answer and solution.

Q508

Strand sort is a stable sorting algorithm.

Select an option to see the answer and solution.

Q509

Auxiliary space used by comb sort is . . . . . . . .

Select an option to see the answer and solution.