1 /* derived from PR c/2100 */
4 extern void exit (int);
11 int listElem[NUM_ELEM]={30,2,10,5};
12 int listSmall[SMALL_N];
14 int posGreatest=-1, greatest=-1;
16 for (i=0; i<SMALL_N; i++) {
17 listSmall[i] = listElem[i];
18 if (listElem[i] > greatest) {
20 greatest = listElem[i];
24 for (i=SMALL_N; i<NUM_ELEM; i++) {
25 if (listElem[i] < greatest) {
26 listSmall[posGreatest] = listElem[i];
28 greatest = listSmall[0];
29 for (j=1; j<SMALL_N; j++)
30 if (listSmall[j] > greatest) {
32 greatest = listSmall[j];
37 if (listSmall[0] != 5 || listSmall[1] != 2)