This study notes covers Functions vs Procedures within Bubble Sort for GCSE Computer Science. Revise Bubble Sort in 3.1 Fundamentals of Algorithms for GCSE Computer Science with 16 exam-style questions and 10 flashcards. This topic appears regularly enough that it should still be part of a steady revision cycle. It is section 4 of 9 in this topic. Use this study notes to connect the idea to the wider topic before moving on to questions and flashcards.
Functions vs Procedures
| Aspect | Function | Procedure |
|---|---|---|
| Returns a value? | Yes - always returns something | No - just performs actions |
| Example | calculateArea(length, width) | printWelcome() |
| Use in expressions? | Yes: total = add(5, 3) | No: just call it |
| GCSE keyword | function...return...endfunction | procedure...endprocedure |
Practice questions for Bubble Sort
Which of the following best describes bubble sort?
Describe how bubble sort works. You should refer to what happens during each pass through the list. [3 marks]
Quick recall flashcards
Why is it called bubble sort?
Largest values bubble up to the end like bubbles rising in water
How does bubble sort work?
Compare adjacent pairs, swap if wrong order, repeat passes