= Online sorts
{wiki=Category:Online_sorts}
"Online sorting" refers to a type of sorting algorithm in which the input is received incrementally, and the algorithm must produce a sorted output at any point in time, even before all of the input has been received. This contrasts with "offline sorting," where the entire dataset is available at once before sorting begins. \#\#\# Key characteristics of online sorting: 1. **Incremental Input**: The algorithm processes elements as they arrive, which means it doesn't have the luxury of accessing the entire dataset upfront.
Back to article page
