#include<stdio.h>
#define TRUE 1
#define FALSE 0
#define OK 1
//冒泡排序 从小到大
int bubbleAscendingSort(int *a,int n)
{
for (int i = n-1, change = TRUE;i>=1&&change; i--)
{
for (int j= 0, t=0; j<i; j++)
{
if (a[j]>a[j+1])
{
t = a[j];
a[j] = a[j + 1];
a[j + 1] = t;
}
}
}
return OK;
}
//冒泡排序 从大到小
int bubbleDescendingSort(int *a, int n)
{
for (int i = n - 1, change = TRUE; i >= 1 && change; i--)
{
for (int j = 0 ; j<i; j++)
{
if (a[j]<a[j + 1])
{
int t;
t = a[j];
a[j] = a[j + 1];
a[j + 1] = t;
}
}
}
return OK;
}
//测试
int main()
{
int a[7];
bubbleDescendingSort(a, 7);
for (int i = 0; i < 7; i++)
{
scanf_s("%d", &a[i]);
}
bubbleAscendingSort(a, 7);
for (int i = 0; i < 7; i++)
{
printf("%d ", a[i]);
}
printf("\n");
for (int i = 0; i < 7; i++)
{
scanf_s("%d", &a[i]);
}
bubbleDescendingSort(a, 7);
for (int i = 0; i < 7; i++)
{
printf("%d ", a[i]);
}
printf("\n");
return 0;
}
数据结构之冒泡排序
最新推荐文章于 2024-03-22 23:21:01 发布