设计在顺序存储结构上实现求子串算法

代码如下：

void subString(char s[],int start,long count,char t[])
{
	long i,j,length=strlen(s);
	if(start<1 || start>length)
	{
		printf("The copy position is wrong!\n");
	}else if(start+count-1>length)
	{
		printf("Too characters to be copied!\n");
	}else
	{
		for(i=start-1,j=0;i