Home of real teaching & learning
  • Full support for teachers
  • Focus on critical thinking
  • Engaging classroom activities
  • Integrated student eBook
  • Assessed tasks / qBank
  • Practice exam questions

The InThinking Guarantee: Our sites are written by expert practitioners and not by AI

See our AI policy

Disclaimer: InThinking subject sites are neither endorsed by nor connected with the International Baccalaureate Organisation.

Don't miss out, find out!

B 2.4 Programming algorithms

This section covers algorithmic thinking in programming: efficiency (Big O notation), linear/binary search (construction, tracing, efficiency), bubble/selection sort (construction, tracing, time/space complexity). HL only: recursion (concept, applications, implementation, limitations). Focus on analysing and implementing algorithms. B 2.4.1 Describe the efficiency of specific algorithms by calculating their Big O...

Help