Sequence table Curriculum

The experiment purpose ：
Master the basic operation of linear table ： Insert 、 Delete 、 Find the implementation on the sequential storage structure .

experimental condition ：
VC++6.0, A computer

Content ：
Build an orderly sequence table , And implement the following operations ：

• 1. Put elements x Insert into the table and keep it in order ;
• 2. The lookup value is x The elements of , If found, delete it ;
• 3. Output the value of each element in the table .

Algorithmic thought ：

/* Build an orderly sequence table , And implement the following operations ： C Language description  1. Put elements x Insert into the table and keep it in order ; 2. The lookup value is x The elements of , If found, delete it ; 3. Output the value of each element in the table .*/ 

#include <stdio.h>
#define MAXSIZE 20
 
// Create sequence table structure 
typedef struct seqlist
{
    
	int elem[MAXSIZE];
	int length;
}SeqList;
 
// Initialization sequence table 
void IniList(SeqList *l)
{
    
	l->length = 0;
}
 
// Insert the elements into the table and keep them in order 
void InsList(SeqList *l, int n)
{
    
	int i = 0, j;
	
	while (n > l->elem[i] && i < l->length)
		i++;
	
	for (j = l->length - 1; j >= i; j--)
		l->elem[j+1] = l->elem[j];
	
	l->elem[i] = n;
	
	(l->length)++;
}
 
// Find out whether an element is in the table 
int CheckList (SeqList l, int n)
{
    
	int i = 0;
	
	while (i < l.length && n != l.elem[i])
		i++;
	
	if (i < l.length)
		return i;
	
	return -1;
}
 
// Find and delete an element 
void DelList (SeqList *l, int n)
{
    
	int  j;
	if (n < 0 || n > l->length - 1)
	{
    
		printf (" empty ！ Please check whether the value is in the sequence table ！\n");
		return ;
	}
	
	for (j = n + 1; j < l->length; j++)
		l->elem[j-1] = l->elem[j];
	
	(l->length)--;
}
 
// Output the elements in the table 
void PrintList(SeqList l)
{
    
	int i;
	for (i = 0; i < l.length; i++)
	{
    
		printf ("%d ", l.elem[i]);
	}
	printf ("\n");
}
 
int main ()
{
    
	SeqList list;
	int index, element;
	
	IniList(&list);		// initialization 
	
	printf (" Please enter the first element : ");		// Input elements 
	scanf ("%d", &element);
	
	printf (" Please enter another element （ With 0 ending ）： ");
	while (0 != element)
	{
    
		InsList(&list, element);		// Insert elements 
		scanf ("%d", &element);
	}
	
	PrintList(list);	// List output element 
	
	printf (" Please enter the element to be deleted : ");
	scanf ("%d", &element);
	
	index = CheckList(list, element);	// Look for the element 
	if (-1 == index)
	{
    
		printf ("%d  Not in the sequence table  \n", element);
	}
	else
		DelList(&list, index);		// If you find , Then delete the element 
	
	PrintList(list);	// Output each element in the list again 
	
	return 0;
}