#include <stdio.h>
#include <assert.h>
void TraversalArray(const int array[], int len)
{
assert(array != NULL);
assert(len >= 0);
unsigned int index = -1;
for(index = 0; index < len; index++)
{
printf("%3d", array[index]);
}
printf("\n");
}
void BubbleSort(int array[], int len)
{
int flag = 1;
int i = 0, j = 0;
for(i = 0; i < len-1; i++)
{
for(j=i+1; j<len; j++)/*反向冒泡排序,先找到最小的,然后次小的*/
{
if(array[j] < array[i])
{
array[i] = array[i] ^ array[j];/*两个数互换*/
array[j] = array[i] ^ array[j];
#include <assert.h>
void TraversalArray(const int array[], int len)
{
assert(array != NULL);
assert(len >= 0);
unsigned int index = -1;
for(index = 0; index < len; index++)
{
printf("%3d", array[index]);
}
printf("\n");
}
void BubbleSort(int array[], int len)
{
int flag = 1;
int i = 0, j = 0;
for(i = 0; i < len-1; i++)
{
for(j=i+1; j<len; j++)/*反向冒泡排序,先找到最小的,然后次小的*/
{
if(array[j] < array[i])
{
array[i] = array[i] ^ array[j];/*两个数互换*/
array[j] = array[i] ^ array[j];