What is the difference between an algorithm and a program?

An algorithm is the plan of steps; a program is that algorithm coded in a language

How does a bubble sort decide whether to swap two values?

It compares adjacent values and swaps them if they are in the wrong order

It works on any list, sorted or not

Breaking a large problem into smaller sub-problems

11questions. Pick an answer and you'll see why right away.

Which computational thinking technique means removing unnecessary detail to focus on what matters?
What is the difference between an algorithm and a program?
Which flowchart symbol represents a decision?
Which condition must be true for a binary search to work correctly?
A sorted list has 1024 items. What is the maximum number of comparisons a binary search needs?
How does a bubble sort decide whether to swap two values?
Which technique is merge sort based on?
Which sort is generally faster on a large list?
What is a key advantage of a linear search over a binary search?
In AQA pseudocode, what does the symbol $<-$ mean?
What does decomposition mean in computational thinking?