#include #include #define ROW 11 #define COL 11 /** * A perfect example of how to use functional * programming to solve a practical problem. * Today's example is how to build a multiplication table (times table as some youth call it). * Author: Ace * Bugs: Output varies visually based on device. There's nothing I can do about this. * Version: * 2018.01.05.00.27: Initial release * 2018.01.05.11.05: Added free() for arr */ void printArray(int **, int, int); void fillArray(int **, int, int); int multiply(int, int); int add(int, int); int main(void) { //One of several ways we allocate space for a 2D array. This is perhaps one of the more straight forward approaches. int **arr = (int **)malloc(ROW * sizeof(int *)); int i; for (i=0; i>= 1; // Note: This must set highest order bit ZERO. It must not copy the sign bit. y <<= 1; } return product; } /** * Utility function for multiply. * Typically, I'd just use the operator but I wanted to show the simplistic implementation of the bitwise operation. Works with or without this. * @param x - First number of operation * @param y - Second number of operation * @return sum of X and Y */ int add(int x, int y) { return y ? add(x ^ y, (x & y) << 1) : x; }

FunctionalTimeTable