What Is a Sorting Algorithm?

Given a collection of items that can be compared — numbers, words, dates, or records with a key — a sorting algorithm produces a new arrangement where every element sits in its correct position relative to the others. For ascending numeric order, that means each value is greater than or equal to the one before it.

The comparison rule is flexible. You can sort integers smallest-to-largest, strings alphabetically, or a list of users by signup date. The algorithm does not care what the data means; it only needs a way to decide whether one element should come before another.

Sorted data unlocks dramatically faster operations:

• Searching — binary search finds an item in a sorted array in O(log n) time versus O(n) for a linear scan. Sorting 1,000,000 items lets you search in about 20 steps instead of a million.
• Deduplication — once equal items sit next to each other, removing duplicates is a single linear pass.
• Merging and joining — combining two sorted datasets is far cheaper than combining unsorted ones, which is why databases sort before merge-joins.
• Human readability — leaderboards, file listings, and search results all rely on order to be useful.

You rely on sorting constantly without noticing: your email inbox ordered by date, a spreadsheet sorted by column, an e-commerce page sorted by price, autocomplete suggestions ranked by relevance, and database queries with an ORDER BY clause. Every one of those is a sorting algorithm doing its job in the background.

The fastest way to build intuition is to watch the bars move. Open the interactive visualizer, pick Bubble Sort to start, and press play. You will see comparisons highlighted, swaps happen in real time, and the array gradually click into order. Then read our algorithm documentation for the complexity details behind each one.