Anson Wong
Menu

Algorithm and Programming for HKDSE ICT: why this elective divides opinion

What this topic covers

Algorithm and Programming extends the compulsory part’s Computational Thinking and Programming into genuinely elective-level territory—more complex algorithms, more demanding tracing, and problems that require combining several ideas rather than applying one at a time. It’s also the elective students tend to either enjoy or find genuinely difficult, with less of a comfortable middle ground than the other two electives.

Main areas

More complex control structures and nested logic. Loops within loops, conditions within conditions—where a small misunderstanding in the compulsory-level basics compounds into a much larger error at this level.

Standard algorithms. Searching (e.g. linear vs. binary search) and sorting, examined both as “explain how this algorithm works” and as “trace this specific algorithm on this specific input”—two different skills that both need practice.

Problem decomposition. Breaking a larger, unfamiliar problem into smaller sub-problems before attempting to code or trace a solution—this is the computational-thinking skill the whole elective ultimately tests.

Efficiency at a conceptual level. Comparing two approaches to the same problem in terms of which does more work—kept at an intuitive, exam- appropriate level rather than formal algorithmic complexity analysis.

How the ideas fit together

This elective is the most direct continuation of a single compulsory topic of any of the three electives—everything here assumes solid command of sequence, selection, iteration, and tracing from Computational Thinking and Programming. A shaky foundation there makes this elective considerably harder than it needs to be, which is why diagnosing exactly where understanding breaks down matters more here than almost anywhere else in the syllabus.

Common difficulties

The most common problem isn’t the “hard” algorithms—it’s that small tracing mistakes (an off-by-one loop boundary, a variable updated in the wrong order) compound across a longer, more complex piece of code, so one early slip produces a completely wrong final answer even when the overall approach was correct. The second common problem is jumping straight to writing code for an unfamiliar problem without first decomposing it on paper, which tends to produce a solution that’s almost right rather than fully correct.

What you should be able to do

  • Trace a more complex algorithm (nested loops, combined conditions) by hand, correctly, under time pressure.
  • Explain how a standard searching or sorting algorithm works, in your own words, not just recite its steps.
  • Decompose an unfamiliar problem into smaller steps before attempting to solve it in code or pseudocode.
  • Compare two approaches to the same problem and explain, intuitively, which does more work and why.

Get in touch

HKDSE ICT Tutoring