Daily Notes
Jul 29, 1:10 AM 25-26
  1. Courses
  2. IB Computer Science Year 1 SL
  3. SL YR 1: Block 1 Daily Notes
  4. September 18, 2025

Quick Links

Syllabus All Notes Class Library
Past Lesson Note

This note is from 10 months ago. You're viewing content from a previous lesson.

Daily Note for September 18, 2025 Past Lesson

B2.4.1 Describe the efficiency of specific algorithms by calculating their Big O notation to analyse their scalability.
B2.4.2 Construct and trace algorithms to implement a linear search and a binary search for data retrieval.
B2.4.3 Construct and trace algorithms to implement bubble sort and selection sort, evaluating their time and space complexities.

 
 
About

Daily Learning Notes give you a quick, clear summary of what we covered in class each day. They’re here to help you review important ideas, remember what you learned, and stay on track — even if you missed a lesson. Each note connects to our learning goals, key concepts, and extra resources so you can study in a way that works best for you.

Contact

Email: [email protected]


© 2026 Bill MacKenty. All rights reserved.