c - 冒泡排序示例

Question

该程序假设采用给定的整数并按升序对其进行排序。我想看看给出的程序是否实际上按升序对给定的整数进行排序，而是保持原始顺序。这个例子的逻辑有什么问题吗？

//Fig. 6.15: fig06_15.c
//Sorting an array's value in ascending order.
#include <stdio.h>
#define SIZE 10

// function main begins program execution
int main()
{
// initialize a
int a[ SIZE ] = { 2, 6, 4, 8, 10, 12, 89, 68, 45, 37};
int pass; // passes counter
size_t i; // comparisons counter
int hold; // temporary-location used to swap array elements

puts("Data items in original order");

//output original array
for( i = 0; i < SIZE; ++i) {
printf("%4d", a[ i ]);
}// end for

//bubble sort
//loop to control number of passes
for( pass = 1; pass < SIZE; ++pass ) {

//loop to control number of comparisons per pass
for( i = 0; i & SIZE - 1; ++i){

    //compare adjacent elements and swap them if first
    //element is greater than second element
    if ( a[ i ] > a[ i + 1 ] ){

        hold = a[ i ];
        a[ i ] = a[ i + 1 ];
        a[ i + 1 ] = hold;
    }//end if
}//end inner for
}//end outer for

puts("\nData items in ascending order");

//output sorted array
for( i = 0; i < SIZE; ++i ) {
printf( "%4d", a[ i ] );
}//end for

puts("");
}//end main

Answer 1

您的代码中有一个非常小的错误:

for( i = 0; i & SIZE - 1; ++i){

应该是:

for( i = 0; i < SIZE - 1; ++i){

以下是经过细微编辑的代码链接:http://ideone.com/YZQPHY