题目如下:设线性表存放在向量A[1..MAXNUM]的前elenum个分量中,且递增有序。试写一算法,将x插入到线性表的适当位置上,以保持线性表的有序性。
我的程序如下:
1. test.c
#include "insert.h"
#include <stdio.h>
int main(void)
{
listtype list;
int i;
float elenum;
/* Initialize the list.*/
list.elenum = 0;
for (i = 0; i < 20; i++)
{
list.A[i] = i + 1;
list.elenum++;
printf("(%d):%f\t", i + 1, list.A[i]);
}
printf("\nThe length of the list:%d\n\n", list.elenum);
/* To test the insert function.*/
insert(&list, 0);
insert(&list, 6.5);
insert(&list, 50);
for (i = 0; i < 23; i++)
printf("(%d):%f\t", i + 1, list.A[i]);
printf("\nThe length of the list:%d\n\n", list.elenum);
return 0;
}
2.insert.h
/* avoid redefine.*/
#ifndef INSERT_H
#define INSERT_H
/* C99 only