Sort the `users` table by age in ascending order.
Problem Statement
Examples
Input: users table: +----+---------+-----+ | id | name | age | +----+---------+-----+ | 1 | Alice | 30 | | 2 | Bob | 25 | | 3 | Charlie | 35 | +----+---------+-----+
Output: +----+---------+-----+ | id | name | age | +----+---------+-----+ | 2 | Bob | 25 | | 1 | Alice | 30 | | 3 | Charlie | 35 | +----+---------+-----+
Explanation: The query retrieves the requested records satisfying all problem requirements.
Complexity
Time Complexity: -
Space Complexity: -
Hints
Editorial & Approach
Problem Overview & Intuition
To solve "Sorting Results (ORDER BY ASC)", we query the relational database engine using declarative SQL. The goal is to sort the `users` table by age in ascending order. By formulating an optimal execution plan with appropriate projection and filtering, the database engine executes the query with minimal overhead.
Step-by-Step Approach
- Analyze Schema: Identify the target tables, necessary foreign keys, and expected output columns.
- Construct Filtering & Logic: Apply row projections to isolate the requested data.
- Format & Order: Sort the resulting records according to specified order criteria.
Optimal Implementation (SQL)
SELECT * FROM users ORDER BY age ASC;
Complexity Analysis
Key Considerations & Edge Cases
- Empty Tables: The query executes safely returning zero rows without syntax error.
- NULL Values: Columns containing NULL values are properly handled by standard ANSI SQL semantics.
- Case Sensitivity: String comparisons and keywords adhere to PostgreSQL/standard SQL rules.