Cambridge (CIE) IGCSE Computer Science - Standard Methods of a Solution

Flashcards covering key concepts from the lecture on standard methods of a solution in computer science, focusing on searching and sorting algorithms.

Searching Algorithm

Precise step-by-step instructions that a computer can follow to efficiently locate specific data in massive datasets.

Linear Search

A searching algorithm that checks every value one at a time, starting from the first value in a dataset.

Dataset

A collection of related data points or values used for analysis or processing.

Bubble Sort

A simple sorting algorithm that checks values in pairs and swaps them if they are not in the correct order.

Pass (in sorting)

A complete run of comparisons from beginning to end of a dataset during a sorting process.

Pseudocode

A high-level description of an algorithm using a structured but informal programming language.

COUNT variable

A variable used in algorithms to keep track of iterations or occurrences.

Totalling

Keeping a running total of values entered into the algorithm.

Maximum Value

The largest value in a list.

Minimum Value

The smallest value in a list.

Average (Mean)

The total of a set of values divided by the number of values in that set.