aboutsummaryrefslogtreecommitdiff
path: root/ch1/1-16_longest-line.c
diff options
context:
space:
mode:
authorzlg <zlg@zlg.space>2013-04-23 13:33:25 -0500
committerzlg <zlg@zlg.space>2013-04-23 13:33:25 -0500
commit82d318879c897b3d665767d74806cd33fe6791c0 (patch)
treea3d2f41ef4e1d11136a3088784c59c604c20e47d /ch1/1-16_longest-line.c
parentSolve Exercise 3-6: itoa (3 arg version) (diff)
downloadknr-82d318879c897b3d665767d74806cd33fe6791c0.tar.gz
knr-82d318879c897b3d665767d74806cd33fe6791c0.tar.bz2
knr-82d318879c897b3d665767d74806cd33fe6791c0.tar.xz
knr-82d318879c897b3d665767d74806cd33fe6791c0.zip
Add exercise descriptions and answers for ch1
* Corrected behavior in solutions for 1-9 and 1-23
Diffstat (limited to '')
-rw-r--r--ch1/1-16_longest-line.c11
1 files changed, 11 insertions, 0 deletions
diff --git a/ch1/1-16_longest-line.c b/ch1/1-16_longest-line.c
index 1f6e556..137bb11 100644
--- a/ch1/1-16_longest-line.c
+++ b/ch1/1-16_longest-line.c
@@ -1,5 +1,16 @@
#include <stdio.h>
+/* The C Programming Language: 2nd Edition
+ *
+ * Exercise 1-16: Revise the main routine of the longest-line program so it
+ * will correctly print the length of arbitrarily long input lines, and as
+ * much as possible of the text.
+ *
+ * Answer: The key to arbitrary limits is buffering. Using a buffer allows you
+ * to tackle a problem in chunks of memory instead of all at once. It's
+ * slightly more complicated, but adds usefulness to a program.
+ */
+
#define MAXLENGTH 100
int get_line(char s[], int lim) {