Neco 2023 Computer Studies Question 46
Practice objective / multiple choice question 46 from the 2023 Neco Computer Studies examination.
Consider the following pseudocode that sorts an array of \(n\) distinct numbers using selection sort: ``` for i = 1 to n-1 min = i for j = i+1 to n if A[j] < A[min] then min = j swap A[i] with A[min] ``` Determine (a) the worst‑case number of comparisons, (b) the worst‑case number of swaps, and (c) the total number of basic operations (comparisons + swaps) when \(n = 200\).
Answer Options
About This Question
This is Neco 2023 Computer Studies Question 46. It is one of the objective questions from the 2023 Neco Computer Studies examination.
Difficulty level: Medium .
Master the Exam!
You've seen a preview, but there are thousands more questions plus AI tutor to break down complex solutions.