C中的数组从低到高排序(不使用qsort)

Question

我有一个函数,它接受一个数字数组,并从低到高排序.到目前为止,我有这个算法,但输出不是我所期望的.有人可以对此有所了解.我不能使用任何C库函数.

/* 
   Sort "count" numbers stored in array numbers[] in non-decreasing order.
   There may be duplicate numbers in the array.
   You may use any sorting algorithm that you know.
 */

void sort( double numbers[], int count )
{
    int i, j, k;
    //printf("%d", count);

    double temp;
    do{
        j = 0;  
        for (i = 0;i<=count;i++){
                if (numbers[i] > numbers[i+1]){//this was numbers[k], which was an error
                    j = 1;
                    temp = numbers[i];
                    numbers[i] = numbers[i+1];
                    numbers[i+1] = temp;
                }
            }
    } while (j == 1);
}

Answer 1

您正在尝试实施冒泡排序算法.阅读本文以了解您的代码缺失的内容.

Answer 2

for循环中的条件i<=count不正确.

阵列中有效的索引是0对count-1.
由于您i+1在循环中访问索引值:

if (numbers[i] > numbers[i+1])

i可以从取的值0到count-2,所以改变条件 i<=count-2或i<count-1