来自「我的串的比较算法实现」· 代码 · 共 38 行

#include<stdio.h>
#include<string.h>
# define MAX 128 
int slength (char ch[])
{
	int i=0; 
    while (ch[i]!='\0')i++;
	return i; 
} 
int scomp(char ch[],char t[]) 
{
	int i, m, n;
	m=slength(ch);
	n=slength(t);
	i=0;
	while(i<m&&i<n)
	{
		if(ch[i]!=t[i])return(ch[i]-t[i]);
		i++;
	}
	if(i==m&&m==n)return 0;
	if(i==m)return -1 ; /*串ch 是串t的前一部分*/ 
	if(i==n)return 1;
} 
void main() 
{
	char ch[MAX],t[MAX];
	int i;
	printf("input the first string:");
	scanf("%s", ch);
	printf("input the second string:");
	scanf("%s",t);
	i=scomp(ch,t);
	if(i==0)printf("Equal\n");/*字典序相等*/
	if(i>0) printf("Larger\n");/*大于*/
	if(i<0) printf("Shorter\n");/*小于*/ 
}