Ascending Order
Ascending order means arranging numbers from smallest to largest.
Formula
a_1 \le a_2 \le a_3 \le \ldots
Definition
Ascending order means arranging numbers from smallest to largest, going up. Formally, a sequence is in ascending (non-decreasing) order if each term is greater than or equal to the previous term, $a_1 \le a_2 \le \ldots \le a_n$, or strictly ascending if each term is strictly greater. This corresponds to the total order on $\mathbb{R}$ (or any ordered set), which satisfies totality, reflexivity, antisymmetry, and transitivity, and ascending sequences are non-decreasing functions from an index set into that ordered set.
Example
$3, 7, 12, 25, 41$ are in ascending order, each number bigger than the last reading left to right. Arrange in ascending order: $-7, 3, -1, 0, 5$ becomes $-7, -1, 0, 3, 5$, with negatives coming first since they are smallest. In real analysis, a bounded ascending sequence converges (the monotone convergence theorem); the sequence $1 - 1/n$ is ascending and bounded above by $1$, converging to $1$.
Key Insight
"Ascending" means "going up," like climbing stairs, each number higher than the last. Sorting a list into ascending order is a fundamental computing problem, solved by algorithms like merge sort and quicksort in $O(n \log n)$ time on average. The monotone convergence theorem, that any bounded monotone sequence of real numbers converges, is a consequence of the completeness of $\mathbb{R}$ and is fundamental throughout analysis and measure theory.