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...