aboutsummaryrefslogtreecommitdiff
path: root/1/13.c
blob: 2a6458bd1595e0f4917e924637d33bdc1b8e4bfa (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
/*
	Exercise 1-13. Write a program to print a histogram of the lengths of words in
	its input. It is easy to draw the histogram with the bars horizontal; a
	vertical orientation is more challenging.
	===
*/

#include <stdio.h>

#define BUF 50	/* max word length */

int main () {
	int c, l, i, lngst;	/* character, length, index, longest */
	int count[BUF];		/* length count */
	
	/* initialise to zero */
	for (i=0; i<BUF; i++) count[i]=0;
	lngst=l=0;

	while ((c=getchar())!=EOF) {
		if (c==' ' || c=='\t' || c=='\n') {	/* space */
			if (l) {	/* if word just ended */
				if (l>lngst) lngst=l;	/* update longest */
				count[l-1]++;	/* add length to count */
				l=0;			/* reset length count */
			}
		} else l++;	/* count word length */
	}
	while (lngst--) {	/* for each count */
		printf("%2.d|", lngst+1);			/* length */
		while (count[lngst]--) putchar('-');/* count (bar) */
		putchar('\n');						/* newline */
	}	
}