C :

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

C++ :

#include<iostream>
using namespace std;
int main(){
	int a[100000],i,j;
	int n;
	cin>>n;
	for( i=0;i<n;i++)
		cin>>a[i];
	for(i=0;i<n-1;i++)
		for(j=0;j<n-i-1;j++){
			if(a[j]>a[j+1]){
				int t=a[j+1];
				a[j+1]=a[j];
				a[j]=t;
			}
		}
		cout<<a[0];
	for(i=1;i<n;i++)
		cout<<" "<<a[i];
	cout<<endl;

}

Pascal :

program maopaopaixu;
var a:array [1..1000] of integer; 
p,n,j,i,temp:integer;
begin
readln(n);
begin
for j:=1 to n do
read(a[j]) ;
end;
begin 
for i:=1 to n do
for j:=1 to n-1 do
if a[j]>a[j+1] then
begin 
temp:=a[j];
a[j]:=a[j+1];
a[j+1]:=temp;
end;
end;
for j:=1 to n do
write (a[j],' ') ;
end.

Java :

import java.util.Scanner;
public class Main
{
	public static void main(String[] args)
	{
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		int arr[]=new int[n];
		for(int i=0;i<n;i++)
		{
			arr[i]=sc.nextInt();
		}
		bubbleSort(arr);
		for(int i=0;i<n-1;i++)
		{
			System.out.print(arr[i]+" ");
		}
		System.out.println(arr[n-1]);
	}
	public static void bubbleSort(int arr[])//冒泡排序
	{
		for(int i=0;i<arr.length-1;i++)
		{
			for(int j=0;j<arr.length-i-1;j++)
			{
				if(arr[j]>arr[j+1])
				{
					int temp=arr[j];
					arr[j]=arr[j+1];
					arr[j+1]=temp;
				}
			}
		}
	}
}