Insertion Sort Quiz Questions And Answers
-
What are the correct intermediate steps of the following data set when it is being sorted with the Insertion sort? 15,20,10,18
-
15,20,10,18 -- 10,15,20,18 -- 10,15,18,20 -- 10,15,18,20
-
15,18,10,20 -- 10,18,15,20 -- 10,15,18,20 -- 10,15,18,20
-
15,10,20,18 -- 15,10,18,20 -- 10,15,18,20
-
10, 20,15,18 -- 10,15,20,18 -- 10,15,18,20
-
Do you know what an insertion sort is? Here's an interesting Insertion Sort Quiz to test your knowledge. It is a simple sorting algorithm that builds the final sorted array one item at a time. This algorithm works similarly to the sorting of playing cards in hands. If you think you have a good understanding of insertion sort, then See moreyou must try this quiz and see if you can pass this test or not. If you score more than 70%, it means that you've passed this quiz. So, get ready to start the quiz!
(492).jpg "Insertion Sort Quiz Questions And Answers - Quiz")
Quiz Preview
- 2.
What will be the number of passes to sort the elements using insertion sort? 14, 12,16, 6, 3, 10
-
7
-
8
-
1
-
5
Correct Answer
A. 5Explanation
Insertion sort works by building a sorted sub-list one element at a time. It iterates through the list, comparing each element to the ones before it and inserting it into its correct position. In this case, the algorithm will require 5 passes to sort the elements completely:
Pass 1: 12, 14, 16, 6, 3, 10
Pass 2: 12, 14, 16, 6, 3, 10
Pass 3: 6, 12, 14, 16, 3, 10
Pass 4: 3, 6, 12, 14, 16, 10
Pass 5: 3, 6, 10, 12, 14, 16Rate this question:
-
- 3.
Which of the following options contain the correct feature of an insertion sort algorithm?
-
Dependable
-
Stable, adaptive
-
Anti-stable
-
None of the above
Correct Answer
A. Stable, adaptiveExplanation
The correct answer is "stable, adaptive." In an insertion sort algorithm, stability refers to the preservation of the relative order of equal elements in the sorted array. Adaptive means that the algorithm's efficiency can be improved if the input is already partially sorted. Both of these features are important in an insertion sort algorithm. The other options, "dependable" and "anti-stable," do not accurately describe the features of an insertion sort algorithm.Rate this question:
-
- 4.
State true or false. Binary search can be used in an insertion sort algorithm to reduce the number of comparisons.
-
True
-
False
Correct Answer
A. TrueExplanation
Binary search can be used in an insertion sort algorithm to reduce the number of comparisons. This is because binary search allows for efficiently finding the correct position to insert an element in a sorted array. By using binary search, the algorithm can quickly locate the correct position and minimize the number of comparisons needed to find the correct position for each element being inserted. This ultimately leads to a more efficient insertion sort algorithm.Rate this question:
-
- 5.
Which of these sorting algorithms is the fastest for sorting small arrays?
-
Insertion sort
-
Quick sort
Correct Answer
A. Insertion sortExplanation
Insertion sort is the fastest sorting algorithm for sorting small arrays because it has a time complexity of O(n^2), which means it performs well for small input sizes. It works by iteratively inserting each element into its correct position in the sorted part of the array. This algorithm has a low overhead and performs efficiently when the array is already partially sorted or contains mostly sorted elements. On the other hand, Quick sort has an average time complexity of O(nlogn) but can have a worst-case time complexity of O(n^2), making it less efficient for small arrays.Rate this question:
-
- 6.
Which of these is not a stable sorting algorithm in its typical implementation?
-
Merge sort
-
Quick sort
-
Insertion sort
-
None of the above
Correct Answer
A. Quick sortExplanation
Quick sort is not a stable sorting algorithm in its typical implementation. Stability refers to the preservation of the relative order of equal elements in the sorted output. Quick sort involves partitioning the array based on a pivot element, and the order of equal elements may change during this process. Therefore, Quick sort does not guarantee the stability of the sorting algorithm. On the other hand, Merge sort and Insertion sort are stable sorting algorithms as they maintain the relative order of equal elements. Hence, the correct answer is Quick sort.Rate this question:
-
- 7.
Consider the following lists of partially sorted numbers. The double bars represent the sort marker. How many comparisons and swaps are needed to sort the next number. [1 3 4 8 9 || 5 2]
-
2 comparisons, 3 swaps
-
3 comparisons, 2 swaps
-
4 comparisons, 3 swaps
-
3 comparisons, 4 swaps
Correct Answer
A. 3 comparisons, 2 swapsExplanation
The given list is partially sorted, with the sort marker indicating the boundary between the sorted and unsorted portions. To sort the next number (5), we need to compare it with each number in the sorted portion until we find its correct position. In this case, we need to make 3 comparisons (with 1, 3, and 4) before finding the correct position for 5. Additionally, we need to make 2 swaps to move the numbers 5 and 2 to their correct positions (5 before 8 and 2 before 5). Therefore, the correct answer is 3 comparisons, 2 swaps.Rate this question:
-
- 8.
Consider the following lists of partially sorted numbers. The double bars represent the sort marker. How many comparisons and swaps are needed to sort the next number. [1 3 4 5 8 9 || 2]
-
5 comparisons, 4 swaps
-
4 comparisons, 5 swaps
-
6 comparisons, 5 swaps
-
5 comparisons, 6 swaps
Correct Answer
A. 6 comparisons, 5 swapsExplanation
To sort the next number, we need to compare it with each number in the partially sorted list until we find its correct position. In this case, the number 2 needs to be compared with 1, 3, 4, 5, 8, and 9, which makes a total of 6 comparisons. Additionally, since the number 2 needs to be placed before the numbers 3, 4, 5, 8, and 9, we need to perform 5 swaps to sort it correctly. Therefore, the answer is 6 comparisons and 5 swaps.Rate this question:
-
- 9.
If all the elements in an input array are equal, for example {1,1,1,1,1,1}, What would be the running time of the Insertion Algorithm?
-
O(2N)
-
O(n^2)
-
O(n)
-
None of the above
Correct Answer
A. O(n)Explanation
The running time of the Insertion Algorithm would be O(n) in this case because even though all the elements in the input array are equal, the algorithm still needs to iterate through each element in order to perform the necessary comparisons and insertions. The number of iterations is directly proportional to the size of the input array, hence the running time is linear.Rate this question:
-
- 10.
What operation does the Insertion Sort use to move numbers from the unsorted section to the sorted section of the list?
-
Finding the minimum value
-
Swapping
-
Finding out an pivot value
-
None of the above
Correct Answer
A. SwappingExplanation
Insertion Sort uses the operation of swapping to move numbers from the unsorted section to the sorted section of the list. In this sorting algorithm, each element is compared with the elements before it in the sorted section, and if it is smaller, it is swapped with the element before it until it reaches its correct position. This process continues until all elements are in their correct sorted positions. Therefore, the correct answer is swapping.Rate this question:
-
Quiz Review Timeline (Updated): Sep 29, 2024 +
Our quizzes are rigorously reviewed, monitored and continuously updated by our expert board to maintain accuracy, relevance, and timeliness.
-
Current Version
-
Sep 29, 2024Quiz Edited by
ProProfs Editorial Team
Expert Reviewed by
Godwin Iheuwa -
Dec 25, 2011Quiz Created by
RosyU
Back to top