The first line gives the count n, and the second line gives n integers.
Print them in ascending order on one line, separated by single spaces.
Repeated numbers are printed as many times as they appear.
4 10 9 2 -5
-5 2 9 10
When you run, these lines are fed to input()/stdin in order (the program doesn't stop to ask).
$ Ready
Open this on a computer to write and run code. On mobile you can read the problem and the solutions.
In JS and TS, a.sort() without a comparison function turns numbers into strings and sorts them in dictionary order, so [10, 9, 2] becomes 10 2 9.
Always write a.sort((x, y) => x - y) (JS numbers are doubles, so subtracting is safe here).
In C, by contrast, returning a - b from a qsort comparator overflows int for 2·10^9 - (-2·10^9) and flips the order, so write (a > b) - (a < b).
The others sort by numeric size by default: Python sorted(a), Java Arrays.sort(a), C# Array.Sort(a), C++ std::sort, Craykon a.Sort().
n = int(input())a = sorted(map(int, input().split()))print(*a)const [n, ...a] = require("fs").readFileSync(0, "utf8").trim().split(/\s+/).map(Number);a.sort((x, y) => x - y);console.log(a.join(" "));import { readFileSync } from "node:fs";const [n, ...a]: number[] = readFileSync(0, "utf8").trim().split(/\s+/).map(Number);a.sort((x, y) => x - y);console.log(a.join(" "));import java.util.Arrays;import java.util.Scanner;import java.util.StringJoiner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = sc.nextInt(); Arrays.sort(a); StringJoiner out = new StringJoiner(" "); for (int x : a) out.add(String.valueOf(x)); System.out.println(out); }}using System;using System.Linq; class Program{ static void Main() { Console.ReadLine(); int[] a = Console.ReadLine().Split(' ', StringSplitOptions.RemoveEmptyEntries).Select(int.Parse).ToArray(); Array.Sort(a); Console.WriteLine(string.Join(" ", a)); }}#include <algorithm>#include <iostream>#include <vector> int main() { int n; std::cin >> n; std::vector<int> a(n); for (int& x : a) std::cin >> x; std::sort(a.begin(), a.end()); for (int i = 0; i < n; i++) std::cout << (i ? " " : "") << a[i]; std::cout << "\n";}#include <stdio.h>#include <stdlib.h> static int ascending(const void *pa, const void *pb) { int a = *(const int *)pa, b = *(const int *)pb; return (a > b) - (a < b);} int main(void) { int n, a[1000]; scanf("%d", &n); for (int i = 0; i < n; i++) scanf("%d", &a[i]); qsort(a, n, sizeof a[0], ascending); for (int i = 0; i < n; i++) printf(i ? " %d" : "%d", a[i]); putchar('\n'); return 0;}n = Console.ReadLine().ToNumber();a = Console.ReadNumbers();a.Sort();Console.WriteLine(a);