Functions vs Procedures
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.
Topic position
Section 4 of 9
Practice
16 questions
Recall
10 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 |
Keep building this topic
Read this section alongside the surrounding pages in Bubble Sort. That gives you the full topic sequence instead of a single isolated revision point.
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
16 questions on Bubble Sort — practise free
Instant marking, adaptive difficulty, and 10 spaced repetition flashcards. Free until your GCSEs.
Try PrepWise Free