Question

Define a word as a string that can only contain alphabetical characters. Given a string of multiple words, each word is separated by one or multiple spaces (‘ ‘) or tabs (‘\t’). You are asked to count the number of words and find the longest word. In C

Answer 1

OUTPUT

CODE

#include<stdio.h>
#include<string.h>

int main()
{
char sent[1000]; // taking user input
printf("Enter a string: ");
gets(sent);
  
int i = 0, top = 0, words = 0; // variables
  
while(sent[i]) // looping as long as string is there
{
int l = 0;
  
while(sent[i]) // for one word if it is valid
{
if((sent[i] >= 'a' && sent[i] <= 'z') || (sent[i] >= 'A' && sent[i] <= 'Z'))
l++;
else
break;
i++;
}
  
if(sent[i] && sent[i] != ' ' && sent[i] != '\t') // word has other characters than alphabets
{
l=0;
while(sent[i] && (sent[i] != ' ' && sent[i] != '\t'))
i++;
}
else // correct words
words++;
  
while(sent[i] && (sent[i]==' ' || sent[i] == '\t')) // ignoring spaces and tabs
i++;
  
if(l > top) // if the current word is longer, updating
top = l;
}
printf("%d %d", words, top); // printing output
  
}

//Please up vote. Thanks!