Ask the Chatbot Games & Quizzes History & Society Science & Tech Biographies Animals & Nature Geography & Travel Arts & Culture ProCon Money Videos

sorting algorithm: Quick Facts

Written and fact-checked by
The Information Architects of Encyclopaedia Britannica

The Information Architects maintain a master list of the topics included in the corpus of  Encyclopædia Britannica, and create and manage the relationships between them.
The Information Architects of Encyclopaedia Britannica

Photos

A chart compares the steps of four sorting algorithms-selection sort, insertion sort, merge sort, and quicksort-using color-coded numbers to illustrate how the sequence 8, 5, 1, 3, 7 is sorted by each method.
A step-by-step diagram of selection sort using the list 8, 5, 1, 3, 7, with green highlighting the current placement position and yellow marking the minimum number found at each step, resulting in a sorted sequence.
Step-by-step diagram showing how the insertion sort algorithm arranges the numbers 8, 5, 1, 3, 7. Blue highlights the current number being sorted, while red indicates sorted numbers.
A step-by-step diagram showing merge sort, with the numbers 8, 5, 1, 3, 7 being grouped and divided by vertical lines, then gradually rearranged until sorted as 1, 3, 5, 7, 8.
A step-by-step diagram of the Quicksort algorithm sorting the numbers 8, 5, 1, 3, 7, with each row showing the current pivot in purple and previously used pivots in orange.
See All Images →

Related Topics and References

Topics