C :

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int s[10000],n,i;
int cmp(const void *a,const void *b)
{
     return(*(int *)a-*(int *)b);//ÉýÐò£»b-a½µÐò
}
int main()
{
    scanf("%d",&n);
    for(i=0;i<n;i++)
	    scanf("%d",&s[i]);
    qsort(s,n,sizeof(s[0]),cmp);
    for(i=0;i<n;i++)
	    printf("%d ",s[i]);
  printf("\n");
    return 0;
}

C++ :

#include <cstdio>
#include <cstdlib>
#include <stack>
#include <algorithm>
using namespace std;
const int MAXN = 1000;
int val[MAXN];
int n;
void InsertSort() {
	int current, l, r, mid;
	for (int i = 1;i < n;i++) {
		current = val[i];
		l = 0; r = i;
		while (l < r) {
			mid = (l + r) / 2;
			if (val[mid] < current)
				l = mid + 1;
			else
				r = mid;
		}
		for (int j = i;j > l;j--)
			val[j] = val[j - 1];
		val[l] = current;
	}
}
int main() {
	scanf("%d", &n);
	for (int i = 0;i < n;i++) {
		scanf("%d", &val[i]);
	}
	InsertSort();
	for (int i = 0;i < n;i++) {
		printf("%d ", val[i]);
	}
	puts("");
	return 0;
}

Java :

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

public class Main {
  private static Scanner s = new Scanner(System.in) ;
  
  public static void main(String[] args) {
	 int num = s.nextInt() ;
	 if(num<=1000){
	 int a[] = new int[num] ;
	 for (int i = 0; i < num; i++) {
		a[i] = s.nextInt() ;
	 }
	 
	 Arrays.sort(a);
	 
	 for (int i = 0; i < a.length; i++) {
		System.out.print(a[i]+" "); 
	  }
	 System.out.println();
	 }
  }
}