#include<stdio.h>
int str_cmp(const char *s1, const char *s2)
{
        unsigned int i = 0, diff;
        while(*(s1+i) && *(s2+i))
        {
                diff = (*(s1+i)-*(s2+i));
                if(!diff)i++;
                else break;
        }
        return diff;
}
int main()
{
        printf("chuma %d ", str_cmp("abcd","abcde"));
        return 0;
}
U can use this as a prototype and enhance this. I havent
even tried compilng this.
Sujith

#include<stdio.h>
main()
{
   
   //please read two strings int str1 and str2//
   
  while(str1[i]!='/0' &&str2[i]!='/0')
       if(str1[i]!=str2[i])
          flag=1;
    if(flag==1)
   printf("equal");
}

int str_cmp( const char *str1 , const char *str2)
{
	

	while(*str1 != '\0')
	{
		if( *str1 == *str2)
		{
			str1++;
			str2++;
		}
		else
			break;
	}

	
	return *str1 - *str2;
}

// Optimize the above soln...
#include<stdio.h>
int str_cmp(const char *s1, const char *s2)
{
        unsigned int i = 0, diff;
        while(s1[i]!= '\0' || s2[i] != '\0'){
                diff = s1[i] - s2[i];
            if(!diff)i++;
                else break;
        }
        return diff;
}
int main(int argc, char *argv[1])
{
        printf("chuma %d ", str_cmp("abcd","abcde"));
        return 0;
}

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

 void stringcmp(char s1[], char s2[]);

int main()
{
   
   char str1[10],str2[10];

   printf("\nEnter first String:");
   scanf("%s",str1);

   printf("\nEnter second String:");
   scanf("%s",str2);

   stringcmp(str1,str2);
   
   return 0;
}

 void stringcmp(char *s1, char *s2)
{
   int i,j;

   for(i=0;s1[i]!='\0';i++)
   {
      for(j=0;s2[j]!='\0';j++)
      {
            if(s1[i] == s2[j])
            continue;
      }
   }

   if (i==j)
   {
     printf("String s1:%s and s2:%s are EQUAL\n",s1,s2);
   }
   else
     printf("String s1:%s and s2:%s are NOT EQUAL\n",s1,s2);

}

#include<iostream.h>
#include<stdio.h>
#include<conio.h>
void main()

{
	clrscr();
	int c=0;
	char a[10];

	char b[10];
	gets(a);
	gets(b);
	for(int i=0,j=0;b[i]!='\0'||a[j]!='\0';i++,j++)
	{
		if(a[i]!=b[j])
		{
			c++;
		     
		}

	}
	if(c==0)
		cout<<"string match";
	else
		cout<<"string does not match";

getch();
}

#include<iostream.h>
#include<stdio.h>
#include<conio.h>
void main()

{
	clrscr();
	int c=0;
	char a[10];

	char b[10];
	gets(a);
	gets(b);
	for(int i=0,j=0;b[i]!='\0'||a[j]!='\0';i++,j++)
	{
		if(a[i]!=b[j])
		{
			c++;
		     
		}

	}
	if(c==0)
		cout<<"string match";
	else
		cout<<"string does not match";

getch();
}

#include<iostream.h>
#include<stdio.h>
#include<conio.h>
void main()

{
	clrscr();
	int c=0;
	char a[10];

	char b[10];
	gets(a);
	gets(b);
	for(int i=0,j=0;b[i]!='\0'||a[j]!='\0';i++,j++)
	{
		if(a[i]!=b[j])
		{
			c++;
		     
		}

	}
	if(c==0)
		cout<<"string match";
	else
		cout<<"string does not match";

getch();
}

1 yes
2 yes

=> ALL ARE CORRECT ANSWER

void main()
{
char a[10],b[10];
int i=0;
scanf("%s%s",a,b);
if(strlen(a)!=strlen(b))
printf("they are different strings");
else
{
while(a[i]!='\0')
{
if(a[i]==b[i])
i++;
else 
{
printf("They are different strings");
exit(0);
}
printf("Both are same");
}
getch();
}

void main()
{
char a[10],b[10];
int i=0;
scanf("%s%s",a,b);
if(strlen(a)!=strlen(b))
printf("they are different strings");
else
{
while(a[i]!='\0')
{
if(a[i]==b[i])
i++;
else 
{
printf("They are different strings");
exit(0);
}
}
printf("Both are same");
}
getch();
}

I have been seeing lot of answers posted on top of mine.
here is another highly optimized version.

int str_cmp (const char *s1, const char *s2)
{
   while (*s1 == *s2++)
     if (*s1++ == 0)
        return (0);
   return (*(unsigned char *)s1 - *(unsigned char *)--s2);
}
before marking it as not an answer, I urge you to try it once!
Trust me, it works.

Guys What the hell????

strcmp tells you whether strings are equal or not, if not which is greater then other.....

So first compare their length...

example let 
str1="abc";
str2="abcde";

now compare their lengths, if len1 >len2 means str1 is greater else
if len2>len1 then str2  is greater

else the above compare is required...........