常见排序-冒泡排序

#include <iostream>using namespace std;/*void bubbleup(int *ptr, int count){for(int i=0; i<count; i=i+1)//for(int j=count-1; j>i; j=j-1)for(int j=i+1; j<count; j=j+1)if(*(ptr+j-1)>*(ptr+j)){int tmp = *(ptr+j-1);*(ptr+j-1) = *(ptr+j);*(ptr+j) = tmp;}}*/void bubbleup(int ptr[], int count){int flag;for(int i=0; i<count-1; i=i+1) {flag = 0;for(int j=count-1; j>i; j=j-1) {if(ptr[j-1]>ptr[j]){int tmp = ptr[j-1];ptr[j-1] = ptr[j];ptr[j] = tmp;flag = 1;}}if (!flag)break;cout<<endl<<"第"<<i+1<<"轮: ";for(int k=0; k<7; k++) cout <<ptr[k] << '\t';cout<<endl;}}int main(){int list[] = {1,-2,3,4,5,2,-32};int i;cout <<"排序前：" ;for(i=0; i<7; i++) cout <<list[i] << '\t';bubbleup(list, 7);cout <<endl<<"排序后：" ;for(i=0; i<7; i++) cout <<list[i] << '\t';cout<<endl;return 0;}