Age | Commit message (Collapse) | Author | Files | Lines | |
---|---|---|---|---|---|
2013-04-16 | Solve Exercise 3-1: binsearch2 | zlg | 1 | -1/+1 | |
2013-04-06 | Solve Exercise 2-10: lower() | zlg | 2 | -1/+33 | |
Also added more information to 2-09's comments. | |||||
2013-04-06 | Solve Exercise 2-9: bitcount() | zlg | 1 | -0/+43 | |
2013-04-04 | Solve Exercise 2-8: rightrot() | zlg | 1 | -0/+52 | |
2013-04-03 | Solve Exercise 2-07: invert() | zlg | 1 | -0/+38 | |
2013-03-31 | Solve Exercise 2-6: setbits() | zlg | 1 | -0/+44 | |
2013-03-27 | Solve Exercise 2-5: The any() function | zlg | 1 | -0/+44 | |
2013-03-22 | Solve Exercise 2-04: Squeeze v2 | zlg | 1 | -0/+51 | |
2013-03-02 | Solve Exercise 2-3: Hex to integer converter | zlg | 1 | -0/+48 | |
This exercise was fun, and I learned a simpler way to convert them. | |||||
2013-02-28 | Change 2-02's solution to a while loop | zlg | 1 | -11/+7 | |
A recursive function is a bit much for something that simple. | |||||
2013-02-27 | Solve Exercise 2-02: No logical operators | zlg | 1 | -0/+44 | |
The text doesn't specify which technique to use. The section outlined operator precedence, but I couldn't think of a way to check for truth in the three main expressions without logical operators. So I turned to a recursive function. It works, but I'm not sure if it's what K&R were after. | |||||
2013-02-21 | Shorten 2-01's code | zlg | 1 | -22/+2 | |
There's no code like no code! :) | |||||
2013-02-21 | Correct 2-01 solution | zlg | 1 | -4/+14 | |
FLT_MIN and DBL_MIN refer to the lowest _positive number_ representable in floating-point form on the machine, not the lowest _negative number_. Subtracting FLT_MAX from 0 will give you the minimum. | |||||
2013-02-21 | Solve Exercise 2-01: Variable limits | zlg | 1 | -0/+142 | |
Fixed gitignore list, too |