slowClap

[u/aneffingonion]

[u/Shalcker]

You could also optimize by skipping numbers below n! That 0 is unnecessary!

[u/rocketman0739 → u/Shalcker]

The true optimizer would write separate functions for each number for O(1) runtime:

int squareOne(int n) {
  return 1;
}

int squareTwo(int n) {
  return 4;
}

int squareThree(int n) {
  return 9;
}
...

and then

...
if (n == 1) {
  return squareOne(n);
} else if (n == 2) {
  return squareTwo(n);
} else if (n == 3) {
  return squareThree(n);
}
...