C :

#include<stdio.h>
int main()
{
	int a[210],i,t,j,s;
	scanf("%d",&t);
	for(i=0;i<t;i++)
		scanf("%d",&a[i]);
	for(i=0;i<t;i++)
		for(j=i;j<t;j++)
			if(a[i]>a[j])
			{
				s=a[i];
				a[i]=a[j];
				a[j]=s;
			}
	for(i=0;i<t;i++)
		printf("%d ",a[i]);
	puts("");
	return 0;
}

C++ :

#include <cstdio>
#include <algorithm>

using namespace std ;

int num[400] ;

int main() {
    int n ;
    scanf("%d" , &n ) ;
    for( int i = 0 ; i < n ; i ++ ) {
        scanf("%d" , &num[i] ) ;
    }
    sort( num , num + n ) ;
    for( int i = 0 ; i < n ; i ++ ) {
        printf("%d " , num[i] ) ;
    }
    return 0 ;
}

Java :

import java.util.Arrays;
import java.util.Scanner;

/**
 * @author : lwj
 * createTime  : 2020/1/14 13:41
 * description : Reprint please indicate the source
 */
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while(sc.hasNext()) {
            int a = sc.nextInt();
            int []arr = new int[a];
            for (int i = 0; i < a; i++) {
                arr[i] = sc.nextInt();
            }
            Arrays.sort(arr);
            for (int b : arr) {
                System.out.print(b + " ");
            }
            System.out.println();
        }
        sc.close();
    }
}