Sorting algorithm - GCSE Computer Science Definition

A sorting algorithm is a set of instructions that computers use to put a list of items in order. Imagine you have a messy list of numbers or words, and you want to arrange them from smallest to largest (ascending) or in alphabetical order. A sorting algorithm helps you do that quickly and efficiently. There are different types of sorting algorithms, like bubble sort, merge sort, and quick sort, each with its way of sorting items. Sorting is important because it makes it easier and faster for computers to find and use information. Understanding how sorting algorithms work is a key part of studying GCSE computer science.