Hand-arranged problem

xiaoxiao2021-03-06  22

#include

#include

#define n 4

INT A = 1, b = 2, c = 3, D = 0; // When D is 0 or negative numbers! !

INT * PT [] = {& A, & B, & C, & D};

#define swapij t = * Pt [i]; * Pt [i] = * pt [j]; * pt [j] = T

Main ()

{

INT I, J, T;

INT count = 0;

While (1) {

For (i = 0; i <= n-1; i )

{Printf ("% d", * pt [i]);

Printf ("/ n");

COUNT ;

For (i = n-1; I && * pt [i-1]> = * pt [i]; i -);

IF (i - == 0) Break;

For (j = n-1; * pt [i]> = * pt [j]; j -);

Swapij;

For (i , j = n-1; i

}

Cout << count << Endl;

}

转载请注明原文地址:https://www.9cbs.com/read-65481.html

New Post(0)