Programming algorithms
B2.4What the syllabus asks of you
- 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.
- B2.4.4 Explain the fundamental concept of recursion and its applications in programming. (HL only)
- B2.4.5 Construct and trace recursive algorithms in a programming language. (HL only)
I'm studying
Drill this topic
Every question on Programming algorithms that your level can use, untimed — answer on paper, then mark yourself against the mark scheme.
Make a worksheet
Choose the years and how many questions, then print it with the answers on separate pages.
266363 questions
These are structured questions, answered in working rather than by picking an option, so they are not listed here one by one. The drill above puts each in front of you with its mark scheme to check against.