using namespace std;
//降序
void BubbleSort(int *a, int arraySize)
{
int i, j, temp;
typedef int Status;
Status flag = 1;
for (i = 1; i < arraySize && flag; i++)
{
flag = 0;
for (j = arraySize - 1; j > i; j--)
{
if (a[j] > a[j - 1])
{
temp = a[j];
a[j] = a[j - 1];
a[j - 1] = temp;
flag = 1;
}
}
}
}
//升序
void BubbleSort1(int *a, int arraySize)
{
int i, j, temp;
typedef int Status;
Status flag = 1;
for (i = 1; i < arraySize && flag; i++)
{
flag = 0;
for (j = 0; j <arraySize - i; j++)
{
if (a[j] > a[j + 1])
{
temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
flag = 1;
}
}
}
}
//升序,优化
void BubbleSort2(int *a, int arraySize)
{
int i, j, temp, pos, bound;
pos = arraySize - 1;
while (pos)
{
bound = pos;
pos = 0;
for (j = 0; j <bound; j++)
{
if (a[j] > a[j + 1])
{
temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
pos = j;
}
}
}
}
八大排序算法(一)—bubble
最新推荐文章于 2023-12-02 20:56:03 发布