数据结构编程实例1990（Data structure programming example 1990）.docVIP

数据结构编程实例1990（Data structure programming example 1990） 30, energy-saving, such as the analysis of the Tao Yuanming phase of doubt Data structure programming example 1. the basic operation of the order table #define LEN 100 Typedef struct sqlist{ Int a[LEN]; Int length; }; Void init (struct SqList *sq) / * * / initialization {int i; For (i=0; iLEN; i++) Sq-a[i]=0; Sq-length=0; } Void creat (struct SqList *sq) / * * / sequence table {int i; Printf (please input length); Scanf (%d, sq-length); Printf (please, input,%d, nums\n, sq-length); For (i=1; i=sq-length; i++) Scanf (%d, sq-a[i]); } Void print (struct SqList *sq) / * * / output sequence table {int i; For (i=1; i=sq-length; i++) Printf (%d, sq-a[i]); Printf (\n); } Void insert (struct SqList *sq, int POS, int x) / * * / order table to insert elements {int i; For (i=sq-length; i=pos; i--) Sq-a[i+1]=sq-a[i]; Sq-a[pos]=x; Sq-length=sq-length+1; } Int delete (struct SqList *sq, int POS) / * * / order table delete elements {int, I, x; X=sq-a[pos]; For (i=pos+1; i=sq-length; i++) Sq-a[i-1]=sq-a[i]; Sq-length=sq-length-1; Return (x); } (main) {int, position, x; Struct SqList *list; Struct SqList slist; Int xz=0; List =slist; While (1) {printf (1.init\n); Printf (2.creat\n); Printf (3.insert\n); Printf (4.delete\n); Printf (5.locate_value\n); Printf (6.locate_pos\n); Printf (7.print\n); Printf (0.exit\n); Printf (please input your choice); Scanf (%d, xz); Switch (XZ) {case 1:init (list); break; Case 2:creat (list); break; Case 3:printf (pleast, input, inset, position (POS), and, value (x)); Scanf (%d%d, position, x); If (position1||positionlist-length+1||list-length=LEN) Printf (position error\n); Else, insert (list, position, X); Break; Case 4:printf (pleast input delete position (POS)); Scanf (%d, position); If (position1||positionlist-length||list-length==0) Printf (position error\n); Else Printf (delete, position=%d, delete, data=%d\n, position, delete (list, position)); Break;; Case 5; Case 6; Case 7:print (list); bre