#include <stdio.h>
typedef enum {
ADD = 0,
SUB,
MUL,
DEVIDE,
INVALID
}COMMANDS;
int add(int a, int b) { return a + b; }
int sub(int a, int b) { return a - b; }
int mul(int a, int b) { return a * b; }
int divide(int a, int b) { return a / b; }
int execute_command(int a, int b, int cmd) {
// Your logic here using function pointer array
int (*fptr)(int, int);
if(cmd < INVALID){
switch (cmd){
case ADD:
fptr =&add;
return fptr(a,b);
break;
case SUB:
fptr =⊂
return fptr(a,b);
break;
case MUL:
fptr =&mul;
return fptr(a,b);
break;
case DEVIDE:
fptr =÷
return fptr(a,b);
break;
}
}
return 0;
}
/*SOLUTION BY ARRAY POINTER
int execute_command(int a, int b, int cmd) {
int (*func_arr[])(int, int) = { add, sub, mul, divide };
if (cmd >= 0 && cmd < 4) {
return func_arr[cmd](a, b);
}
return 0;
}
*/
int main() {
int a, b, cmd;
scanf("%d %d %d", &a, &b, &cmd);
int result = execute_command(a, b, cmd);
printf("%d", result);
return 0;
}
Solving Approach
Input
10 5 0
Expected Output
15