UVa-10474-Where is the Marble?

AOAPC I: Beginning Algorithm Contests (Rujia Liu) :: Volume 1. Elementary Problem Solving ::Sorting/Searching

// 10474 - Where is the Marble?#include <iostream>#include <cstdlib>using namespace std; int cmp(const void* a, const void* b){    if( *(int*)a <  *(int*)b ) return -1;    if( *(int*)a == *(int*)b ) return 0;    if( *(int*)a >  *(int*)b ) return 1;} int main(void){    int N, Q, n, q, i, x, cnt=1;    int a[10000];   // Total no of test cases is less than 65!    while(cin>>N>>Q && N!=0)    {        for(n=1; n<=N; n++)            cin >> a[n];        qsort(a+1, N, sizeof(int), cmp);         cout << "CASE# " << cnt++ << ":" << endl;        for(q=1; q<=Q; q++)        {            cin >> x;            for(i=1; i<=N; i++)                if(a[i] == x)                {                    cout << x << " found at " << i << endl;                    break;                }            if(i == N+1)                cout << x << " not found" << endl;        }    }    return 0;}