Question

A programmer is debugging a Selection Sort

implementation. They notice that after the first pass, the smallest element is correctly placed at the beginning, but subsequent passes do not consistently place the next smallest element. What is a common logical error that could cause this?

A The inner loop for finding the minimum element starts from the beginning of the array in every pass.

B The swap operation is performed only if the minimum element is not already in its correct position.

C The outer loop iterates n times instead of n-1 times.

D The index of the minimum element is not correctly updated within the inner loop.

E The array is not initialized with distinct values.

Practice Next

More IT Operating System Questions

Find the simplified of the following expression:

12% of 10% of 15% of 5000 + (12 x 15) = ?
Find the value of the expression:

32 + 6 – 5 × [18 + 10 – 3 × (36 – 21)]
(√7225 x √1225)/(√625) = ?
74% of 2840 + 80% of 1640 - ?= 47²
115 ÷ 23 + 12 × 6 = ? + 16 - 35
The value of (40 + 3/4 of 32) /[37 + 3/4 of (34-6)] is:
(3984 ÷ 24) x (5862 ÷ 40) = ?
(70% of 480) ÷ 6 + ? = 45% of 3500 + 80² + 27²

A programmer is debugging a Selection Sort

Solution