/***************************************************************/
/* FUNCTION: GenListCredCards
 * 
 * Purpose: Generate a list of valid credit card numbers and put 
 *          them into an array
 * Given:
 *    array to be filled
 *    number of credit card numbers to generate
 *    number of digits in each credit card number
 * 
 * Returns:
 *    No value returned, but array is filled
 * 
 * NOTE: Credit Card Numbers are "Sparse" - most possible numbers
 *       are not valid. If using 3 digits, it numerically possible
 *       to use all 1000 numbers from 0-999, but this function 
 *       does not consider 9/10ths of them to be valid - so the 
 *       max number of credit card numbers that could be generated 
 *       is 100. Don't ask for more than that, the function cannot 
 *       deliver any more.
 ***************************************************************/
void GenListCredCards (int array[], int numToGen, int numDigit);


/***************************************************************/
/* FUNCTION: GenSearchList
 * 
 * Purpose: Generate a list of credit card numbers that people are
 *          trying to use for purchases and put them into an array
 *
 * Given:
 *    array to be filled
 *    number of credit card numbers to generate
 *    number of digits in each credit card number
 * 
 * Returns:
 *    No value returned, but array is filled
 * 
 * NOTE: Credit Card Numbers can be repeated - a number could be 
 *       presented by a customer more than once. Some numbers 
 *       generated may be valid but currently unassigned, some may
 *       be completely invalid.
 *
 ***************************************************************/
void GenSearchList(int array[], int numToGen, int numDigit);

/***************************************************************/
/* FUNCTION: ApproxLog2N
 * 
 * Purpose: Calculate an approximate Log based two of a given number
 *
 * Given:
 *    value to take the log of
 * 
 * Returns:
 *    log based 2 of passed number
 * 
 * NOTE: returns first value above (e.g. log2 of 12 returns 4;
 *           log2 of 20 returns 5 etc). This is good becaise in 
 *       figuring efficiency you ensure that you get the worst 
 *       case.
 *
 ***************************************************************/
int ApproxLog2N (int value);