1 /*数组a指定多项式的各个系数，n指定多项式的最高次数，x指定自变量的值，返回多项式的值*/
   2 double p(double x, double a[], int n) {
   3    double result = 0.0;
   4    int i = 0;
   5    for(i = n; i >= 0; i--) {  //n+2次
   6       result *= x;            //n+1次
   7       result += a[i];         //n+1次
   8    }
   9 }

   1 /*顺序表list递增有序，insert_order将x插入到list当中使list仍然递增有序*/
   2 void insert_order(seq_list *list, ElemType x){
   3    int i, pos;
   4    for(i = 0; i < list->size; i++)
   5       if(list->elem[i] >= x)
   6          break;
   7    pos = i;
   8    for(i = list->size-1; i >= pos; i--)
   9       list->elem[i+1] = list->elem[i];
  10    list->elem[pos] = x;
  11 }

   1 /*删除顺序表list中从pos开始的num个元素*/
   2 void delete_from_ith(seq_list *list, int pos, int num){
   3    int i;
   4    pos--; /*把元素的逻辑位置变成数组中的存放位置。逻辑位置从1开始，存放物理位置从0开始，两者差1*/
   5    for(i = pos+num; i < list->size; i++)
   6       list->elem[i-num] = list->elem[i];
   7 }

   1 /*list指向带头结点单链表的头结点，元素递增有序排列，算法删除其中大于min小于max的所有元素*/
   2 void delete_between_min_and_max(linklist list, int min, int max) {
   3    node *p, *q, *nextq;
   4    for(p = list; p->next->data <= min; p = p->next)
   5       ;
   6    q = p->next;
   7    while(q!=NULL && q->data < max) {
   8       nextq = q->next;
   9       free(q);
  10       q=nextq;
  11    }
  12    p->next = q;
  13 }

   1 /*将顺序表list中所有元素的顺序倒过来*/
   2 void reverse(seq_list *list) {
   3    int i;
   4    for(i = 0; i < list->size /2; i++) {
   5       ElemType temp = list->elem[i];
   6       list->elem[i] = list->elem[list->size - i -1];
   7       list->elem[list->size-i-1] = temp;
   8    }
   9 }

   1 /*将头结点为list的带头结点单链表中所有的元素的顺序倒过来*/
   2 void reverse(linklist list) {
   3    node *p = list->next;
   4    list->next = NULL;
   5    while(p != NULL) {
   6       node *q = p->next;
   7       p->next = list->next;
   8       list->next = p;
   9       p = q;
  10    }
  11 }

   1 /*A和B为两个按照元素递增顺序排列的带头结点的单链表，将A和B合并成带头结点的单链表C，C中的元素是递减排列的，C中的节点空间为原来的A和B中的节点空间，返回单链表C*/
   2 linklist merge(linklist A, linklist B) {
   3    linklist C;
   4    node *pa = A->next;
   5    node *pb = B->next;
   6    C = A;
   7    C->next = NULL;
   8    free(B);
   9    while(pa && pb) {
  10       if(pa->data < pb->data) {
  11          node *temp = pa->next;
  12          pa->next = C->next;
  13          C->next = pa;
  14          pa = temp;
  15       } else {
  16          node *temp = pb->next;
  17          pb->next = C->next;
  18          C->next = pb;
  19          pb = temp;
  20       }
  21    }
  22    while(pa) {
  23       node *temp = pa->next;
  24       pa->next = C->next;
  25       C->next = pa;
  26       pa = temp;
  27    }
  28    while(pb) {
  29       node *temp = pa->next;
  30       pa->next = C->next;
  31       C->next = pa;
  32       pa = temp;
  33    }
  34    return C;
  35 }

   1 void remove_pre(node *s) {
   2    node *p;
   3    for(p = s; p->next->next != s; p = p->next)
   4       ;
   5    free(p->next)
   6    p->next = s;
   7 }