C :

#include<stdio.h>
int main()
{
  int i,j,n,k,t;
  int a[100];
  scanf("%d",&n);
  for(i=0;i<n;i++)
    scanf("%d",a+i);
for(i=0;i<n-1;i++)
{
	k=i;
	for(j=i+1;j<n;j++)
     if(a[k]>a[j]) k=j;
	 if(k!=i) {t=a[i];a[i]=a[k];a[k]=t;}

}
for(i=0;i<n;i++)
printf("%d ",a[i]);
printf("\n");
	return 0;
}

C++ :

#include <stdio.h>
int main() {
	void sort(int *vals[], int n);
	int *vals[100], val[100], i, n;
	scanf("%d", &n);
	for (i = 0;i < n;i++) {
		scanf("%d", &val[i]);
		vals[i] = &val[i];
	}
	sort(vals, n);
	for (i = 0;i < n;i++)
		printf("%d ", *vals[i]);
	printf("\n");
	return 0;
}
/* 选择排序函数 */
void sort(int *vals[], int n) {
	int i, j, **p, *temp;
	for (i = 0;i < n - 1;i++) {
		p = vals + i;
		for (j = i + 1;j < n;j++) {
			if (*vals[j] < **p)
				p = vals + j;
		}
		temp = *p; *p = vals[i]; vals[i] = temp;
	}
}

Pascal :

var
  a:array[1..10000] 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-1 do write(a[i],' ');
  writeln(a[n],' ');
end.

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<=100){
	 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();
	 }
  }
}