Bubble sort - GCSE Computer Science Definition

Bubble sort is a simple sorting algorithm used in computer science to arrange a list of elements in a certain order, typically ascending or descending. In the context of a GCSE Computer Science course, bubble sort repeatedly steps through the list, compares adjacent pairs of elements, and swaps them if they are in the wrong order. This process is repeated for each element in the list until no more swaps are needed, indicating that the list is sorted. Although bubble sort is easy to understand and implement, it is not very efficient for large datasets due to its high time complexity, making it best suited for educational purposes and small lists.