Wednesday, September 08, 2010

[UVa] 11462 - Age Sort

Used algorithm: Counting Sort
Just count how many times an age appeared.



Loop (i = 1 -> 100) {
if (table[i] has some value) {
Show i for that amount of times.
}
}



If anybody knows some better algorithm or Input/Output method for faster performance please contact.


#include <stdio.h>
int main() {

int I, N, J, AGE, maxAGE, PPL[101]={0};

while (scanf("%d",&N) && N!=0) {
maxAGE = 0;
for (I=0 ; I<N ; I++) {
scanf("%d",&AGE);
if (AGE>maxAGE)
maxAGE = AGE;
PPL[AGE]++;
}
for (I=0 ; I<101 ; I++) {
if (PPL[I])
for (J=0 ; J<PPL[I] ; J++) {
if (I==maxAGE && J==PPL[I]-1) printf("%d\n",I);
else printf("%d ",I);
}
PPL[I] = 0;
}
}

return 0;
}

No comments:

Post a Comment

Post your comment here. If you want to say something about programming problems, scripts, software etc, please try to be as descriptive as possible.

Connect Rapoo MT750S with Linux (Tested on Manjaro)

 I bought this obvious copy of MX Master 2S in hopes of having the device switching functionality along with a lightweight body because I ha...