-
Notifications
You must be signed in to change notification settings - Fork 26
/
Copy pathreadability.c
93 lines (77 loc) · 1.8 KB
/
readability.c
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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
/*
https://cs50.harvard.edu/x/2022/psets/2/readability/
*/
#include <cs50.h>
#include <stdio.h>
#include <string.h>
#include <ctype.h>
#include <math.h>
int count_letters(string text);
int count_words(string text);
int count_sentences(string text);
int main(void)
{
// Get user input
string text = get_string("Text: ");
// Variables for letters, words, sentences
int letters = count_letters(text);
int words = count_words(text);
int sentences = count_sentences(text);
// Calculate average number of letters & average number of sentences
float avgLetters = (100 / (float)words) * (float)letters;
float avgSentences = (100 / (float)words) * (float)sentences;
// Calculate Coleman-Liau index
int index = round(0.0588 * avgLetters - 0.296 * avgSentences - 15.8);
// Print out index based on result
if (index < 1)
{
printf("Before Grade 1\n");
}
else if (index >= 16)
{
printf("Grade 16+\n");
}
else
{
printf("Grade %i\n", index);
}
}
// Determine the number of letters in a string
int count_letters(string text)
{
int letters = 0;
for (int i = 0, len = strlen(text); i < len; i++)
{
if (isalpha(text[i]))
{
letters++;
}
}
return letters;
}
// Determine the number of words in a string
int count_words(string text)
{
int words = 1;
for (int i = 0; text[i] != '\0'; i++)
{
if (text[i] == ' ')
{
words++;
}
}
return words;
}
// Determine the number of sentences in a string
int count_sentences(string text)
{
int sentences = 0;
for (int i = 0; text[i] != '\0'; i++)
{
if (text[i] == '.' || text[i] == '!' || text[i] == '?')
{
sentences++;
}
}
return sentences;
}