Recursion, Searching, Sorting, and Pointers/assign_1.c
void genMatrix(int A[][COL]){
    //gens a random num for each element in the array
    for (int i = 0; i < ROW; i++){
        for (int j = 0; j < COL; j++){
            A[i][j] = rand() % 101; //assigns a random positive int from 0 - 100 to a position in the array 
                                    //(0 + (rand() % (100 + 1 - 0)) is the formula used to get 101
        }
    }
}
/*
    genMatrix: generates a random num from 0 - 100 and stores it in a NxM matrix
    input: the array to be used to store the numbers
*/
generates a random num from 0 - 100 and stores it in a NxM matrix
input: the array to be used to store the numbers
generates a random num from 0 - 100 and stores it in a NxM matrix input : the array to be used to store the numbers
void genMatrix(int A[][COL]){
    for (int i = 0; i < ROW; i++){
        for (int j = 0; j < COL; j++){
            A[i][j] = rand() % 101; 
        }
    }
}
void genMatrix ( int A [ ] [ COL ] ) { for ( int i = 0 ; i < ROW ; i ++ ) { for ( int j = 0 ; j < COL ; j ++ ) { A [ i ] [ j ] = rand ( ) % 101 ; } } }
genMatrix: generates a random num from 0 - 100 and stores it in a NxM matrix
input: the array to be used to store the numbers
genMatrix : generates a random num from 0 - 100 and stores it in a NxM matrix input : the array to be used to store the numbers
//gens a random num for each element in the array //assigns a random positive int from 0 - 100 to a position in the array  //(0 + (rand() % (100 + 1 - 0)) is the formula used to get 101