IB Computer Science Topic B2.4 Programming Algorithms (SL/HL) covers syllabus content. Use these notes, questionbank, flashcards, and lessons to review the topic, practise exam questions, and move between notes, videos, flashcards, and lessons where available.
What this topic covers
B2.4.1 Efficiency of Specific Algorithms and Big O Notation
B2.4.2 Constructing and Tracing Algorithms for Linear and Binary Search
B2.4.3 Constructing and Tracing Bubble Sort and Selection Sort, Evaluating Time and Space Complexities
B2.4.4 Fundamental Concept of Recursion and Its Applications in Programming (HL only)
B2.4.5 Constructing and Tracing Recursive Algorithms in a Programming Language (HL only)