Topic 1: Computational thinking, level 3

It uses a brute-force approach

It uses a divide-and-conquer approach

It compares adjacent elements and swaps them if necessary

It searches for an item in an array

To add complexity

To simplify models

To increase memory usage

To slow down algorithms

AND

OR

NOT

XOR

To write pseudocode

To debug syntax errors

To provide a visual representation of an algorithm

To optimise memory usage

It uses a divide-and-conquer approach

It compares adjacent elements and swaps them if necessary

It searches for an item in an array

It merges two sorted lists

To debug syntax errors

To track variable values during execution

To evaluate logical expressions

To create flowcharts

A count-controlled loop repeats for a fixed number of times, a condition-controlled loop repeats until a condition is met

A count-controlled loop repeats until a condition is met, a condition-controlled loop repeats for a fixed number of times

A count-controlled loop is faster, a condition-controlled loop is slower

A count-controlled loop is slower, a condition-controlled loop is faster

Bubble sort

Merge sort

Linear search

Iteration over data structure

To change values during execution

To store values that do not change during execution

To increase memory usage

To reduce readability

It uses a brute-force approach

It uses a divide-and-conquer approach

It compares adjacent elements and swaps them if necessary

It searches for an item in an array