【算法】【冒泡排序】

int main()
{
	int arr[] = {3,6,4,2,11,10,5};
	int i = 0, j = 0 ;
	int len = sizeof(arr)/sizeof(arr[0]);
	int temp = 0;
	for(i=0; i<len; i++){
		for(j=i; j< len; j++){
			if(arr[i]>arr[j]){
				temp = arr[i];
				arr[i] = arr[j];
				arr[j] = temp;
			}
		}
	}
	
	for(i=0; i<len; i++){
		printf("%d\t", arr[i]);
	}
	printf("\n");
	return 0;
}

时间复杂度为O(N^2)