C :

#include<stdio.h>
void sort(int a[],int n)
{
	int i,j,k;
	int temp;
	for(i=0;i<n;i++)
	{
		k=i;
		for(j=i+1;j<n;j++)
		{
			if(a[k]>a[j])
			    k=j;
		}
		temp=a[i];
		a[i]=a[k];
		a[k]=temp;
	}
}
int main(void)
{
	int n;
	int i,x;
	scanf("%d",&n);
	int a[n];
	for(i=0;i<n;i++)
	{
		scanf("%d",&x);
		a[i]=x;
	}
	sort(a,n);
	for(i=0;i<n;i++)
	{
		printf("%d ",a[i]);
	}
	printf("\n");
	return 0;
}

C++ :

#include <stdio.h>
int main() {
	void sort(int array[], int n);
	int dat[100];
	int n, i;
	scanf("%d", &n);
	for (i = 0;i < n;i++)
		scanf("%d", &dat[i]);
	sort(dat, n);
	for (i = 0;i < n;i++)
		printf("%d ", dat[i]);
	puts("");
	return 0;
}
void sort(int array[], int n) {
	int i, j, temp;
	for (i = 0;i < n - 1;i++) {
		for (j = i + 1;j < n;j++) {
			if (array[j] < array[i]) {
				temp = array[i];
				array[i] = array[j];
				array[j] = temp;
			}
		}
	}
}

Pascal :

var
  a:array[1..100] of longint;
  i,j,t,n:longint;
begin
  readln(n); 
  for i:=1 to n do read(a[i]);
  readln;
  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 write(a[i],' ');
end.

Java :

import java.util.*;

public class Main {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		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 ();
	}	
}