Age | Commit message (Collapse) | Author | Files | Lines |
|
|
|
|
|
|
|
|
|
|
|
|
|
This exercise was fun, and I learned a simpler way to convert them.
|
|
A recursive function is a bit much for something that simple.
|
|
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.
|
|
There's no code like no code! :)
|
|
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.
|
|
Fixed gitignore list, too
|
|
|
|
My initial solution tried to simplify the conditions for outputting a
space. You really do need two 'if's in there.
|
|
Printing a newline for each whitespace character was the wrong behavior.
|
|
It was bugging me and the exercises are simple, so I pumped'em out.
|
|
Escape sequences were being compared with the 'or' operator instead of
the 'and' operator. If I had left it alone, every escape sequence
would've borked it.
|
|
I'm glad to be done with chapter 1. It feels like I'm starting to gain
momentum. I'm certainly looking forward to using higher level constructs
like switch(), which I think is available in Chapter 2. So far so good!
|
|
Committing before I try something different.
|
|
|
|
* Removed unnecessary get_line() function in 1-17
* Corrected grammar in README, added an acknowledgement
|
|
1-13 uses less variables and a for loop for the chart header
1-20 has minor changes
1-21 was rewritten to behave properly
README has been rewritten to reflect the limitations of my
solutions
|
|
Thanks to ##c's rizlah
|
|
|
|
|
|
|
|
|
|
|