/en-tutor-prep-s6-ict-sorting-searching-algorithms-practice-4/
/en-tutor-prep-s6-ict-sorting-searching-algorithms-practice-4/
General Inquiry: info@TutorZone.com.hk
Office Hours: Monday to Saturday - 9:00 AM to 6:00 PM
WhatsApp Monday to Sunday - 24 hours
Hotline: +852 6828 1809
Instant Support: +852 9061 3106

S6 ICT: Sorting and Searching (error rework)

S6 ICT: Sorting and Searching (error rework)

  • 2026-11-20

S6 ICT: Sorting and Searching (error rework)

The fourth paper targets common slips: ten frequent confusions corrected one by one in a single pass.

Error rework: the ten commonest confusions This paper targets repeated slips. Binary search requires sorted data; one bubble pass fixes a single item so 8 items need 7 passes; linear search wins on small or one-off searches; selection and bubble sort share n(n-1)/2 comparisons; merge sort needs O(n) extra space; selection sort on 10 items swaps at most 9 times; O(n^2) can be fine for tiny inputs; the midpoint needs floor division; indexes change after sorting; exchange sort is not selection sort.

01 Paper details (check answers afterwards)

Item Detail
Questions 10
Suggested time 25
Difficulty mix Foundation 3 · Intermediate 3 · Challenge 3 · Error redo 1
Chapter Chapter: S6 ICT: Sorting and Searching Algorithms
Level Error rework (10 items)

02 Questions (10 items)

  1. FoundationError 1: binary search works on unsorted data.
  2. FoundationError 2: one pass of bubble sort sorts the whole array.
  3. FoundationError 3: linear search is always slower than binary search.
  4. IntermediateError 4: selection sort makes fewer comparisons than bubble sort.
  5. IntermediateError 5: merge sort needs no extra memory.
  6. IntermediateError 6: sorting only affects speed, never the search result.
  7. ChallengeError 7: an O(n^2) algorithm is always slower than an O(n log n) one.
  8. ChallengeError 8: the midpoint should be written as (low + high) / 2.
  9. ChallengeError 9: each record keeps its original index after sorting.
  10. Error redoError 10: exchange sort and selection sort are the same thing.

03 Answers and one-line notes

# Answer One-line note
1 False: the data must be sorted, otherwise discarding half after the midpoint test is invalid. Without order the discarded half may still hold the target.
2 False: a pass fixes only the largest (or smallest) item. 8 items need 7 passes unless a pass makes no swaps and can stop early.
3 False: for tiny data or a single search, a linear scan is faster and simpler. With 8 items, 8 versus 3 is only 2 times, before paying any sorting cost.
4 False: both take 45 comparisons in the worst case for 10 items. Selection sort saves swaps (at most n-1), not comparisons.
5 False: merging needs a temporary array, so space is O(n). In-place sorts exist, such as heapsort, but merge sort is not one of them.
6 False: binary search on unsorted data can wrongly report “not found”. Breaking an algorithm precondition corrupts the answer, not just the speed.
7 False: for small inputs the constants and overhead can favour the simpler algorithm. With 3 to 10 items insertion sort often beats merge sort despite the worse growth rate.
8 False: indexes are integers, so use floor division (low + high) // 2. True division produces a fractional index, which is invalid.
9 False: sorting moves records, so indexes change; store the original key separately. This is the usual source of mismatched records.
10 False: exchange sort swaps whenever a pair is out of order, while selection sort swaps once per pass. For 10 items selection sort swaps at most 9 times, whereas exchange sort can swap far more.

04 What to do after marking

  • After marking, redo only the wrong items and write down which step went wrong (formula, unit, or misread number).
  • Repeat the same item two days later; move to the next paper only when both attempts are correct.
  • Parents only need the answer and note columns; there is no need to explain every item.

Want to separate bubble, selection, insertion and merge sort, then replace a linear scan with binary search? Book a TutorZone tutor and count every comparison in twenty-five minutes.Tutor Registration →

Questions and answers are written originally by the TutorZone team and are not taken from any school, publisher or examination authority paper. Every value is checked by computer.

Join as a tutor or coach — academic, music, sports, arts, STEM. Free to register. See how it works →