C :

#include <stdio.h>
#define MaxSize 1000
typedef  struct
{
    int data[MaxSize];
    int length;
}Sqlist;

int main()
{
    Sqlist la;
    while(scanf("%d",&la.length)!=EOF)
    {
        int  i, j;
        for(i = 0; i < la.length; ++i)
           scanf("%d", &la.data[i]);
        int flag;
        for(i = la.length-1; i >= 0; --i)
        {
           flag = 0;
           for(j = 1; j <= i; j++)
             if(la.data[j-1] > la.data[j])
             {
                int temp =la.data[j];
                la.data[j] = la.data[j-1];
                la.data[j-1] = temp;
                flag = 1;
             }
           if(flag ==0)
                 break;
       }
       for(i = 0; i < la.length; ++i)
       {
         printf("%d ", la.data[i]);
       }
       printf("\n");
    }
    return 0;
}

C++ :

#include<stdio.h>

int main()
{
	int n,i,j,t,a[100];
	while(scanf("%d",&n)!=EOF)
	{
		for(i=0;i<n;i++)
			scanf("%d",&a[i]);
		for(i=0;i<n-1;i++)
			for(j=i+1;j<n;j++)
				if(a[i]>a[j])
				{
					t=a[i];
					a[i]=a[j];
					a[j]=t;
				}
		for(i=0;i<n;i++)
			printf("%d ",a[i]);
		puts("");
	}
	return 0;
}

Pascal :

var t,i,j,n:longint;
    a:array[1..99999]of longint;
begin
while not eof do
   begin
  readln(n);
  for i:=1 to n do read(a[i]);
  for i:=1 to n-1 do
   for j:=i+1 to n do
   if a[i]>a[j] then begin t:=a[i]; a[i]:=a[j]; a[j]:=t; end;
  for i:=1 to n do
  begin
  write(a[i],' ');
  end;
  writeln();
 end;
end.

Java :

import java.util.*;

public class Main{
	public static void main (String[] args) {
		Scanner in=new Scanner(System.in);
		while(in.hasNext()){
		int n=in.nextInt();
		int []a=new int[n];
		for(int i=0;i<n;i++)
			a[i]=in.nextInt();
		java.util.Arrays.sort(a);
		for(int j=0;j<n;j++)
			System.out.print (a[j]+" ");
		System.out.println ();
		}
	}
}