Informatics — Grade 11

4 topics

1. 1

   Sorting algorithms: bubble sort

   Sorting puts data in order and speeds up searching. We study bubble sort, trace it step by step and see why it is slow on big arrays.

   Chapter 1. Algorithms2 min

2. 2

   Search algorithms: linear and binary

   Linear search works on any list, while binary search finds an element very quickly in a sorted array. You will learn both methods and when to choose each.

   Chapter 1. Algorithms2 min

3. 3

   Recursion

   Recursion is a function calling itself. Using factorial and Fibonacci numbers we study how recursion is built, its base case and its pitfalls.

   Chapter 1. Algorithms2 min

4. 4

   Quicksort: divide and conquer

   Quicksort splits an array into two parts around a pivot and sorts each part recursively. We look at its idea, a Python implementation and its advantage over bubble sort.

   Chapter 1. Algorithms2 min