排序算法之插入排序

# include <stdio.h>

void insertSort(int * a);

int main(void)
{
	int i;

	int a[6] = {2,5,0,1,4,3};
	for(i=0; i<6; i++)
		printf("%d ",a[i]);
	printf("\n");
	insertSort(a);
	for(i=0; i<6; i++)
		printf("%d ",a[i]);
	return 0;
}

void insertSort(int * a)
{
	int i,j;
	for( i=1; i<6; i++)
	{
		int temp = a[i];
		j = i;
		for( ; j>0 && temp<a[j-1]; j--)
		{
			a[j] = a[j-1];
			a[j-1] = temp;
		}
	}
}

package org.SORT;

public class insertSort {

	public static void main(String[] args) {
		int a[] = {2,5,0,1,4,3};
		for(int i=0; i<a.length; i++ )
			System.out.print(" "+a[i]);
		insertSort(a);
		System.out.println("\n"+"****************");
		for(int i=0; i<a.length; i++ )
			System.out.print(" "+a[i]);
	}

	public static void insertSort(int[] a) {
		for(int i=1; i<a.length; i++){
			int temp = a[i];
			int j = i;
			for( ; j>0&&a[j]<a[j-1]; j--){
				a[j] = a[j-1];
				a[j-1] = temp;
			}
		}
	}

}