From 1e3c2d4e3d2e6fd22e42e95cb5a1802204913931 Mon Sep 17 00:00:00 2001 From: philsquared Date: Tue, 28 Dec 2010 05:02:35 -0800 Subject: [PATCH] Updated Getting the source code (markdown) --- Tutorial.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Tutorial.md b/Tutorial.md index dfb0067..af0a2b1 100644 --- a/Tutorial.md +++ b/Tutorial.md @@ -34,7 +34,7 @@ Let's start with a really simple example. Say you have written a function to cal } ``` -This will compile to a complete executable, which responds to command line parameters. If you just run it with no arguments it will execute all test cases (in this case there is just one), report any failures, report a summary of how many tests passed and failed and return the number of failed tests (useful for if you just want a yes/ no answer to: "did it work"). +This will compile to a complete executable, which responds to [[command line parameters]]. If you just run it with no arguments it will execute all test cases (in this case there is just one), report any failures, report a summary of how many tests passed and failed and return the number of failed tests (useful for if you just want a yes/ no answer to: "did it work"). Now the more awake among you may notice that the Factorial function will hit problems when the return value starts to exceed the range of an unsigned int. With factorials that can happen quite quickly. Assuming 32-bit ints the maximum value is 4,294,967,295. Let's add a few more test for this: