Skip to main content

Counting Words in a String using C

Counting words in a String using C:
This is very good exercise to test new programmers pointer skills. The task is to count the words in a given string using C. Well there might be many ways you can do it, I will demonstrate mine way.
Note that mine solution might not be the optimal one, but it gets the job done.

Logic:
How to calculate words in a given string using C. Well I generally use two pointers, one pointer pointers to first char of the string, second point to next char. Then we compare the content on the two pointers. There will be 3 cases:
  1. Both pointers are blank chars (space), so that means we are in between words
  2. First pointer is blank, other is not. This is denote beginning of the Word.
  3. Rest cases will be when either in the middle of the words or at the ending of the words.
Check this image for clarity.

The two Orange dots represent the two pointers in the middle of words.
The two Green dots represent when first char is blank and other is not. this marks the beginning of the word and here we count the word.
The two red dots represent the case when pointers are in the middle of the words, we don't do anything.
Why are we using 2 pointers?
This will allow our function to count the words that are separated by more then one space (which is very handy, when user puts too many spaces in the string)

Code:


#include<stdio.h>
#include<conio.h>
#include<string.h>// for strlen function

int countWord(const char* str)
{
    int c=0,l,i;
    char* p1;//first pointer
    char* p2;//second pointer
    p1=str;//assing first pointer to first char of string
    p2=p1+1;//assign 2nd pointer to next of first
    l=strlen(str);
    printf("\n String has  %d length",l);
    
    
    if(p1==NULL)
    {
        return(0);
    }
    else
    {
        //check if first char is space or not, if not then its the first word
        if(*p1!=' ')
        {
            c=1;
        }
    }
    
    for(i=0;i<l;i++)
    {
        
        if((*p1==' ')&&(*p2==' '))
        {
            //both p1 and p2 are blank , so do nothing
        }
        else if((*p1==' ') && (*p2!=' '))
        {
            //first pointer is blank but second is not, means a word is there
            c++;    
        }
        else
        {
            // rest dont need to worry
            
        }
        //increment both pointers
        p1++;
        p2++;
    }
    
    
    return(c);
}

int main()
{
    char *name;
    printf("\n Enter a string= ");
    gets(name);
    printf("%s",name);
    printf("number of words=%d",countWord(name));
}

Popular posts from this blog

Find nth Prime Number in C++

c++ program to find prime numbers: The problem of finding prime number can be solved by checking all numbers, testing them for prime and then moving ahead. If you want to calculate nth prime. Then this can be done in a brutal way by checking the number one by one. This may sound odd, by there is no easy way then this  for prime numbers (Well Actually there are like Pollard's Rho Algorithm, Number Sieves or Shor's Quantum Algorithm, but we are talking about the one that most people may understand easily). There may be way to pre-calculate the prime numbers but that again is not sufficient. So how can we use c++ to create a program to find prime numbers.

Program to find nth Prime number in C

Objective: To print any Prime number in C.  This task may sound easy but is a very good exercise to help optimize CPU intensive programs. Finding Prime number is a very CPU hogging task and it becomes even more dreaded as the number starts to grow. Lets say we want to find 30001th prime. how will we find it?? Here is the program. Programming logic : The easiest method is to check if the given number N is divisible by any number from 2 to N-1. But it may be noted that we don't need to go beyond the number that is square root of N.  why?? lets have a look. Say we are testing number 49 for prime number. Our objective is to find any number that may divide it. so we start from 2,3,4 etc. As soon as we cross 7 there will be no number that will divide 49, if there was we have got it earlier since it will be smaller then 7.  Get it? another example 64 : 2x32 4x16 8x8 16x4 32x2 as you can see when we pass number 8 we don't need to test as the number that will come ,...