一个有序顺序表，插入一个元素x之后，仍然保持有序

#include<stdio.h>
#define maxsize 10
typedef struct
{
	int data[maxsize];
	int length;
}sqlist;
int Find(sqlist l, int x)
{
	int i;
	for (i = 0; i < l.length; i++)
	{
		if (l.data[i] > x)
			return i;
	}
}
void insert(sqlist &l,int x)
{
	int j, k;
	j = Find(l, x);
	for (k = l.length - 1; k >= j; k--)
	{
		l.data[k + 1] = l.data[k];
	}
	l.data[j] = x;
	++(l.length);
}
int main()
{
	int x = 8;
	int i = 0, j = 0;
	sqlist l = { {1,3,5,7,9,11,13 },7 };
	insert(l, x);
	while (j < l.length)
	{
		printf("%d ", l.data[j++]);
	}
	return 0;
}