void bubbleSort(char s[], int size)
{
for (int i = 0; i < size - 1; i++)
{
for (int j = 1; j < size - i; j++)
{
int n = s[j];
int k = s[j - 1];
if (n < k)
{
s[j] = -s[j] + s[j - 1];
s[j - 1] = -s[j] + s[j - 1];
s[j] = s[j] + s[j - 1];
}
}
}
}
<每日一算法>冒泡排序
最新推荐文章于 2024-10-01 23:05:47 发布