Programmer exam remedial note - the fourth day

For (i = 0; i <7; i )

Printf ("% D, A [i]);

}

It seems really right, there is no mistake, maybe it is not careful. The teacher is that this kind of skill can be seen, let me slowly come to my mistake, in fact, it is wrong to finally don't assign an element, because there is no initial pass value, the number of random builds may be large, or may be very Less, but if you just smaller than the plug, it is no longer correct. Ok, I said my mistake, let us see a correct program.

#define n 8

Main ()

{

INT A [n] = {20, 30, 40, 50, 60, 70, 80};

INT N, I;

For (i = 8; I> = 0; I -)

{

}

a [i 1] = n;

}

Here is a better sorting algorithm. When you tell these sort, the teacher draws a picture, such as the fourth day.

This figure can be convenient to indicate the sorting situation at the time, and the sequence is clearer. However, more importantly, it is not to make people only look at the source program. I don't know what this is. Because I also finished reading this program, I saw the model model, so I recommend everyone to learn this method.

Speaking of sorting, we teach us a new way of sorting, which is the bubbling order. I remember that I have learned in QB before, but I listened to the teacher today that I have a hand drawing, I really become more clear. It is said that the bubble sorting method can also be called the left downstreaming method, because it is determined by the two loops of the procedure. If it is from the bottom to the top, it is Of course, it is bubble. On the contrary, it is sinking from the top. Obvious two programs:

INT n = 6, i, j;

For (i = N-1; I> 0; I -)

For (j = 0; j

IF (a [j]> a [j 1] {exchange};

The above is the bubbling method