C :

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

}
    return 0;
}

C++ :

#include<stdio.h>
#include<algorithm>
using namespace std;
double s[20];
int main()
{
 int n,i;
 while(scanf("%d",&n)!=EOF)
 {
  for(i=0;i<n;i++)
  {
   scanf("%lf",&s[i]);
  }
  sort(s,s+n);
  for(i=0;i<n-1;i++)
  {
   printf("%.2lf ",s[i]);
  }
  printf("%.2lf\n",s[i]);
 }
 return 0;
}

Java :

import java.util.Scanner;
class Main {
	public static void main(String[] args) {
		Scanner reader=new Scanner(System.in);
		boolean flag=true;
		while(flag){
			int a=reader.nextInt();
			double[] b=new double[a];
			for(int i=0;i<b.length;i++){
				b[i]=reader.nextDouble();
			}  
			for(int i=0;i<b.length;i++){
				for(int j=i;j<b.length-1;j++){
					if(b[j+1]<b[i]){
						double c=b[j+1];
						b[j+1]=b[i];
						b[i]=c;
					}
				}
			}
			for(int i=0;i<b.length;i++){
                if(i==b.length-1){
                System.out.printf("%.2f",b[i]);
                }else{
				System.out.printf("%.2f ",b[i]);
                }
			}
          System.out.println("");
		}
	}

}