knr/ch2, branch master Category-0 solutions to The C Programming Language, 2nd Edition https://git.zlg.space/knr/atom/ch2?h=master 2016-06-16T17:15:33Z The massive astyle sweep! 2016-06-16T17:15:33Z zlg zlg@zlg.space 2016-06-16T17:15:33Z urn:sha1:f8d9ff23eb8d3e3286ff5cf4d5f9493532991bb7 Code style should be consistent now. All future commits will be run through astyle or they will be amended. Solve Exercise 3-1: binsearch2 2013-04-16T05:53:42Z zlg zlg@zlg.space 2013-04-16T05:53:42Z urn:sha1:736bbc64f2b0af4faead40be3dc98ebe7f9fcbff Solve Exercise 2-10: lower() 2013-04-06T10:41:28Z zlg zlg@zlg.space 2013-04-06T10:41:28Z urn:sha1:84f1c31fcf1a073e161ece6284272ff75ee0dcf2 Also added more information to 2-09's comments. Solve Exercise 2-9: bitcount() 2013-04-06T09:14:36Z zlg zlg@zlg.space 2013-04-06T09:14:36Z urn:sha1:a91f4d1ad6b5389617f8941e70face69ad94dfda Solve Exercise 2-8: rightrot() 2013-04-04T11:12:40Z zlg zlg@zlg.space 2013-04-04T11:12:40Z urn:sha1:927df414819f236b900f9f0d925b1a6a9385c115 Solve Exercise 2-07: invert() 2013-04-03T12:15:17Z zlg zlg@zlg.space 2013-04-03T12:15:17Z urn:sha1:3529fb7a854a969f7fadf0d5310c659b933ea276 Solve Exercise 2-6: setbits() 2013-03-31T10:38:14Z zlg zlg@zlg.space 2013-03-31T10:38:14Z urn:sha1:06c2a9d69b05cc717299b0325f5001ff0303eecf Solve Exercise 2-5: The any() function 2013-03-27T10:00:43Z zlg zlg@zlg.space 2013-03-27T10:00:43Z urn:sha1:239a885d441cdb3585c42b594ed9e87b37b33c62 Solve Exercise 2-04: Squeeze v2 2013-03-22T16:41:52Z zlg zlg@zlg.space 2013-03-22T16:41:52Z urn:sha1:999a2d4dcf3d918e37f76aae249b7b23f14bdd7d Solve Exercise 2-3: Hex to integer converter 2013-03-02T14:23:14Z zlg zlg@zlg.space 2013-03-02T14:23:14Z urn:sha1:8b718555012492253951b63eb33b45e22a2ce807 This exercise was fun, and I learned a simpler way to convert them. Change 2-02's solution to a while loop 2013-02-28T06:03:30Z zlg zlg@zlg.space 2013-02-28T06:03:30Z urn:sha1:d6e0262ddbbbea7d207631a7889bb2e83a11d79d A recursive function is a bit much for something that simple. Solve Exercise 2-02: No logical operators 2013-02-27T11:54:58Z zlg zlg@zlg.space 2013-02-27T11:54:58Z urn:sha1:8557e29d33b365816114996d04531468e13e78b1 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. Shorten 2-01's code 2013-02-21T09:37:12Z zlg zlg@zlg.space 2013-02-21T09:37:12Z urn:sha1:3fc054da068cfb6b44cc026e33d28a4f628a31cd There's no code like no code! :) Correct 2-01 solution 2013-02-21T09:34:20Z zlg zlg@zlg.space 2013-02-21T09:34:20Z urn:sha1:43f5f3755d7fa66d9f525fe94fcc1517d3be55b9 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. Solve Exercise 2-01: Variable limits 2013-02-21T09:04:40Z zlg zlg@zlg.space 2013-02-21T09:04:40Z urn:sha1:831e4405d64b571f885e92b62b976ad2ced16b2e Fixed gitignore list, too