Data Structure Questions and Answers – Selection Sort

This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Selection Sort”.

1. What is an in-place sorting algorithm?
a) It needs O(1) or O(logn) memory to create auxiliary locations
b) The input is already sorted and in-place
c) It requires additional storage
d) It requires additional space
View Answer

2. In the following scenarios, when will you use selection sort?
a) The input is already sorted
b) A large file has to be sorted
c) Large values need to be sorted with small keys
d) Small values need to be sorted with large keys
View Answer

3. What is the worst case complexity of selection sort?
a) O(nlogn)
b) O(logn)
c) O(n)
d) O(n²)
View Answer

4. Select the appropriate code that performs selection sort.
a)

        int min;
	for(int j=0; j<arr.length-1; j++)
	{
		min = j;
		for(int k=j+1; k<=arr.length-1; k++)
		{
			if(arr[k] < arr[min])
				min = k;
		}
		int temp = arr[min];
		arr[min] = arr[j];
		arr[j] = temp;
       }

b)

        int min;
	for(int j=0; j<arr.length-1; j++)
	{
		min = j;
		for(int k=j+1; k<=arr.length; k++)
		{
			if(arr[k] < arr[min])
				min = k;
		}
		int temp = arr[min];
		arr[min] = arr[j];
		arr[j] = temp;
	}

c)

        int min;
	for(int j=0; j<arr.length-1; j++)
	{
		min = j;
		for(int k=j+1; k<=arr.length-1; k++)
		{
			if(arr[k] > arr[min])
				min = k;
		}
		int temp = arr[min];
		arr[min] = arr[j];
		arr[j] = temp;
	}

d)

        int min;
	for(int j=0; j<arr.length-1; j++)
	{
		min = j;
		for(int k=j+1; k<=arr.length; k++)
		{
			if(arr[k] > arr[min])
				min = k;
		}
		int temp = arr[min];
		arr[min] = arr[j];
		arr[j] = temp;
	}

5. What is the advantage of selection sort over other sorting techniques?
a) It requires no additional storage space
b) It is scalable
c) It works best for inputs which are already sorted
d) It is faster than any other sorting technique
View Answer

6. What is the average case complexity of selection sort?
a) O(nlogn)
b) O(logn)
c) O(n)
d) O(n²)
View Answer

7. What is the disadvantage of selection sort?
a) It requires auxiliary memory
b) It is not scalable
c) It can be used for small keys
d) It takes linear time to sort the elements
View Answer

8. The given array is arr = {3,4,5,2,1}. The number of iterations in bubble sort and selection sort respectively are __________
a) 5 and 4
b) 4 and 5
c) 2 and 4
d) 2 and 5
View Answer

9. The given array is arr = {1,2,3,4,5}. (bubble sort is implemented with a flag variable)The number of iterations in selection sort and bubble sort respectively are __________
a) 5 and 4
b) 1 and 4
c) 0 and 4
d) 4 and 1
View Answer

10. What is the best case complexity of selection sort?
a) O(nlogn)
b) O(logn)
c) O(n)
d) O(n²)
View Answer

Sanfoundry Global Education & Learning Series – Data Structures & Algorithms.

To practice all areas of Data Structures & Algorithms, here is complete set of 1000+ Multiple Choice Questions and Answers.