C++ :

#include<bits/stdc++.h>
using namespace std;
#define M 100005
int A[M],cnt[M],B[M];
int main(){
      int n,x;
      cin>>n;
	   
      for(int i=1;i<=n;i++){
      	cin>>A[i]; 
      	cnt[A[i]]++;
	  } 
	  for(int i=1;i<=M;i++)cnt[i]=cnt[i]+cnt[i-1];
	  for(int i=n;i>=1;i--)B[cnt[A[i]]--]=A[i];
	  
	  for(int i=1;i<=n;i++) printf("%d ",B[i]); 
      return 0;
}

Pascal :

var i,pos,j,n,t,min:integer;
    a:array[1..100] of integer;
begin
  readln(n);
  for i:=1 to n do read(a[i]);

  for i:=1 to n-1 do
  begin
    min:=a[i]; pos:=i;
    for j:=i+1 to n do
      if a[j]<min then
        begin
          min:=a[j];
          pos:=j;
        end;
      t:=a[i];a[i]:=a[pos];a[pos]:=t;
   end;
 for i:=1 to n do
   write(a[i],' ');
end.