C语言冒泡排序

C语言冒泡排序:

 

#include <stdio.h>
int main(int argc, char *argv[])
{
	int arr[] ={8,6,3,9,2,4};
	int length=sizeof(arr)/sizeof(arr[0]);
	int i=0;
	int j=0;
	for( i = 0; i <=length; i++)
	{
  		 for(j = 1; j <= length-i; j++)
    		 {
        		if(arr[j] < arr[j-1])
          			{
           			 int temp = arr[j];
						arr[j] = arr[j-1];
            			arr[j-1] = temp;
					}
				}	
	}
	int k = 0;
	for(k = 0; k< length;k++)
	{
 		printf("arr[%d] = %d\n",k,arr[k]);
	} 
	
	printf("\n数组长度 = %d\n",length);

	return 0;
}
/*
arr[0] = 2
arr[1] = 3
arr[2] = 4
arr[3] = 6
arr[4] = 8
arr[5] = 9

数组长度 = 6*/