I just started O'Caml tonight, so I apologize if it's a bit of an obvious question.
| code: |
# let rec factorial a =
if a == 1 then a else a * factorial (a-1);; val factorial : int -> int = <fun> # factorial 4;; - : int = 24 # factorial 13;; - : int = -215430144 |
I'm not sure why my function there is returning a negative value. I know that once the result becomes too big, the function will result 0, but I can't see why it would ever return a negative value like that.
I also tried it for another recursive function and the same thing happened once I got high enough.
| code: |
# let rec f x power =
if power == 1 then x else x * f x (power-1);; val f : int -> int -> int = <fun> # f 4 3;; - : int = 64 # f 4 15;; - : int = -1073741824 |
Could someone just tell me if I'm doing something wrong here.
Thanks in advance.
