Code Example Ch 10-1
An int array stores the following values:
$$\begin{array} { | l | l | l | l | l | l | l | }
\hline 9 & 4 & 12 & 2 & 6 & 8 & 18 \
\hline
\end{array}$$
-Refer to Code Example Ch 10-1: How many passes will it take in total for the selection sort to sort this array?
A) 2
B) 4
C) 5
D) 6
E) 7

Question

Code Example Ch 10-1
An int array stores the following values:
 $$\begin{array} { | l | l | l | l | l | l | l | } 
\hline 9 & 4 & 12 & 2 & 6 & 8 & 18 \
\hline
\end{array}$$
-Refer to Code Example Ch 10-1: How many passes will it take in total for the selection sort to sort this array?
A) 2
B) 4
C) 5
D) 6
E) 7

Quizplus · Accepted Answer

Selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from unsorted part and putting it at the beginning. The algorithm maintains two subarrays in a given array: the subarray which is already sorted and the remaining subarray which is unsorted. In every iteration of selection sort, the minimum element from the unsorted subarray is picked and moved to the sorted subarray. Given an array of 7 elements, it will take 6 passes for the selection sort to sort the entire array because in each pass, one element is placed in its correct position. After 6 passes, the last element will naturally be in its correct position, so there's no need for a 7th pass.

Code Example Ch 10-1 an Int Array Stores the Following 941226818\begin{array} { | l | l | l | l | l | l | l | } \hline 9 & 4 & 12 & 2 & 6 & 8 & 18 \\\hline\end{array}9​4​12​2​6​8​18​​

Code Example Ch 10-1
an Int Array Stores the Following $\begin{array} { | l | l | l | l | l | l | l | } \hline 9 & 4 & 12 & 2 & 6 & 8 & 18 \\\hline\end{array}$