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.1 Big O Notation

This section provides a comprehensive guide to understanding and analysing algorithm efficiency, a key concept in computer science. We'll explore how to evaluate algorithms using Big O notation, calculate time and space complexities, and learn how to choose the right algorithm for different situations. Before we dive into efficiency, let's recap what an algorithm is. An algorithm is simply a step-by-step set of...

Help