Computer Science · May / June 2024 · Paper 21 · Question 6
2210
As printed in the paper
The question as text
The flowchart represents an algorithm. INPUT Limit Count 1 No START STOP OUTPUT Numbers[Result] INPUT Numbers[Count] Result Limit DIV 2 + 1 Swap Numbers[Count] Numbers[Count] Numbers[Count + 1] Numbers[Count + 1] Swap Flag True Count Count + 1 IS Count > Limit? Count Count + 1 Flag TRUE Yes No No No Yes Yes Yes Flag False Count 1 IS Numbers[Count] > Numbers[Count + 1]? IS Count > Limit – 1? IS Flag = TRUE?
Read automatically from the paper; the printed page above is exact.
Show the answer and mark scheme
6(a)[7]
6(b)[3]
Make a free account to save your answers and see your weak topics and ask the AI why a wrong answer is wrong.