operation.cpp

#include "list.h"
#include "operation.h"


void insert_sorted(List &L, infotype x) {
    /**
    * IS : List may be empty
    * PR : insert an infotype x into an already sorted List L
    *      so that the elements inside List L is still sorted in ascending order,
    *      procedure must also check if such number is already exists (No Duplicate number),
    *      allocate new element only if the conditions are met
    * FS : elements in List L sorted in ascending order, x is inside List L
    */

    //-------------your code here-------------

    address Q, P;
    P = allocate(x);
    if(first(L) == NULL){
      insertFirst(L, P);
    }else{
      Q = first(L);
      while((next(Q) != NULL) && (x > info(Q))){
        Q = next(Q);
      }
      if(info(Q) != x){
        if(x > info(Q)){
          insertLast(L, P);
        }else if(x < info(Q)){
          insertFirst(L, P);
        }else{
          insertAfter(L, Q, P);
        }
      }
    }

    //----------------------------------------
}