1 #include <iostream> 2 using namespace std; 3 void bubbleSort(int data[],int length) 4 { 5 if (data == nullptr || length <= 0) 6 { 7 return; 8 } 9 for (int i = 0 ; i < length ; i++) 10 { 11 for (int j = length-1 ; j > i ; j --) 12 { 13 if (data[j] < data[j-1]) 14 { 15 swap(data[j],data[j-1]); 16 } 17 } 18 printf("第%d次排序后的结果 : " ,i+1); 19 for (int i =0 ;i < length ;++i) 20 { 21 printf("%d ",data[i]); 22 } 23 printf("\n"); 24 } 25 } 26 int main() 27 { 28 int data[] = {2,5,1,4,0,-3,59,-78,62,3}; 29 bubbleSort(data,sizeof(data)/sizeof(int)); 30 printf("\n\n"); 31 for (int i =0 ;i < sizeof(data)/sizeof(int) ;++i) 32 { 33 printf("%d ",data[i]); 34 } 35 printf("\n"); 36 return 0; 37 }
1 #include <iostream> 2 using namespace std; 3 void bubbleSort(int data[],int length) 4 { 5 if (data == nullptr || length <= 0) 6 { 7 return; 8 } 9 for (int i = 0 ; i < length ; i++) 10 { 11 for (int j = length-1 ; j > i ; j --) 12 { 13 if (data[j] < data[j-1]) 14 { 15 swap(data[j],data[j-1]); 16 } 17 } 18 printf("第%d次排序后的结果 : " ,i+1); 19 for (int i =0 ;i < length ;++i) 20 { 21 printf("%d ",data[i]); 22 } 23 printf("\n"); 24 } 25 } 26 int main() 27 { 28 int data[] = {2,5,1,4,0,-3,59,-78,62,3}; 29 bubbleSort(data,sizeof(data)/sizeof(int)); 30 printf("\n\n"); 31 for (int i =0 ;i < sizeof(data)/sizeof(int) ;++i) 32 { 33 printf("%d ",data[i]); 34 } 35 printf("\n"); 36 return 0; 37 }
///每次排序找到最小的放到前面,与选择排序相比,冒泡排序多次打乱数组内的数据,也就是将数组中的值多次修改
输出结果为:
原文:https://www.cnblogs.com/hit-ycy/p/10852375.html