1、//冒泡排序算法
void Bubble_Sort(int *int_array, int len)
{
int i = 0,continue_flag = 1;
while (true)
{
continue_flag = 0;
for (i = 1; i < len; i++)
{
//若为反序则交换
if (int_array[i]<int_array[i-1])
{
int_array[i] ^= int_array[i-1];
int_array[i-1] ^= int_array[i];
int_array[i] ^= int_array[i-1];
continue_flag = 1;
}
}
if (continue_flag == 0)
{
break;
}
}
}
2、//这里是打印函数
void Print(int *int_array,int len)
{
int i = 0;
for (i = 0; i < len; i++)
{
cout << *(int_array+i)<<" ";
}
cout << "\r\n";
}
3、//测试主函数
int main(int argc,char**argv)
{
int array[5] = { 3, 2, 1, 8, 0 };
Bubble_Sort(array, 5);
Print(array, 5);
return 0;
}
得出结果如下图
