C :

#include <stdio.h>
int main()
{
     char a[10];
     int i,j,t;
     for(i = 0;i < 10;i ++)
     scanf("%d",&a[i]);
     for(i = 0;i < 9;i ++)
     {
          for(j = i + 1;j < 10;j ++)
          {
               if(a[i] > a[j])
               {
                    t = a[i];
                    a[i] = a[j];
                    a[j] = t;
               }
          }
     }
     for(i = 0;i < 10;i ++)
          printf("%d\n",a[i]);
     return 0;
}

C++ :

#include<cstdio>
#include<cstring>

int main(){

     int a[11]={};
     for(int i=0;i<=9;i++){
          scanf("%d",&a[i]);
     }

     int flag=0;

     for(int j=9;j>=0;j--){
          for(int k=0;k<j;k++){
               if(a[k]>a[k+1]){
                    a[10]=a[k+1];
                    a[k+1]=a[k];
                    a[k]=a[10];
                    flag=1;     
               }
          }
          if(flag==0){
               break;
          }
     }
     
     for(int i=0;i<=9;i++){
        printf("%d\n",a[i]);
     }

     return 0;
}

Pascal :

var
  a:array[1..100] of longint;
  n,i,j,t:longint;
begin
n:=10;
  for i:= 1 to n do read(a[i]);
  for i:=1 to n-1 do
    for j:=n downto i+1 do
      if a[j-1]>a[j] then
        begin
		  t:=a[j-1];
		  a[j-1]:=a[j];
		  a[j]:=t;
		end;
  for i:= 1 to n do writeln(a[i]);
end.