#include<stdio.h>
#include<stdlib.h>
#define ADDLIST 10;
#define LIST_INIT_SIZE   100
typedef struct
{
        int *p;
        int length;
        int listsize;
}SqList;
void creatSqList(SqList **r,int n)
{
     int i;
     r->p =(int *)malloc(LIST_INIT_SIZE*sizeof(int));
     if(!r->p) exit(0);  //fail to assign storage
     r->length = 0;
     r->listsize = LIST_INIT_SIZE; //size(at the begin)
     for(i=0;i<n;i++)
     {
       printf("输入第%d个值:",i);
       scanf("%d",r->p);
     }
}
int findInsertPlace(SqList **r,int x)
{
    int i=0;
    while(i<r->length&&*(r->p)<x)
        (r->p)++;
    if(i>=r->length)
    printf("找不到插入的位置!请检查您的数据.");
    else
    return i;
}
void insert(SqList **r,int insertValue,int i)
{   
     int *end,*insert;  // end point to the end adress
     if(i<1||i>(r->length)+1)
     {
       printf("i值不合法!");
       exit(0);
     }
     if((r->length)>=(r->listsize))
     {
       insert = (int *)realloc(r->p,(r->listsize+ADDLIST)*sizeof(int));
       r->p = insert;
       r->listsize += ADDLIST;
     }
     insert = r->(p+i-1);  //insert是插入的位置
     for(end = r->p+(r->length-1);end>=insert;--end)// end point to the end adress
       *(end+1) = *insert;
       *insert = insertValue;
       (r->length)++;
}
void outputSqList(SqList **r)
{
     for(;((*r)->p)<(*r)->(p+((*r)->length-1));((*r)->p)++;)
       printf("%d",r->p);         
}
//此例子只能输入递增的元素
int main()
{
      SqList *r;
      int n = 4; // size
      int x =  4;//value
      creatSqList(&r,n); //n是线性顺序表的长度
      insert(&r,x,findInsertPlace(SqList &r,int x)); //x是要插入的值
       outputSqList(&r);
      system("pause");
      return 0;
}
//斗胆在这里发了， 在C里没人回

//////////////////
//
//  try it :-)
//
//////////////////
#include <stdio.h>
#include <stdlib.h>

#define ADDLIST 10;
#define LIST_INIT_SIZE   100

typedef struct
{
  int * p;
  int length;
  int listsize;
}SqList;

void creatSqList(SqList & r, int n)
{
  int i;
  r.p = (int *)malloc(LIST_INIT_SIZE*sizeof(int));
  if(r.p == NULL) //fail to assign storage
    exit(0);  
  r.length = 0;
  r.listsize = LIST_INIT_SIZE; //size(at the begin)
  for(i=0; i<n; i++)
  {
    printf("输入第%d个值:", i);
    scanf("%d", r.p + i);
    r.length++;
  }
}

int findInsertPlace(SqList & r, int x)
{
  int i=0;
  int * temp = r.p;
  for(i = 0; i<r.length; i++)
  {
    if(*(temp)<x)
    {
      temp++;
      continue;
    }
    else
      break;
  }
  if(i == r.length)
    printf("找不到插入的位置!请检查您的数据.");
  else
    return i;
}

void insert(SqList & r, int insertValue, int i)
{   
  int * end;
  int * insert;  // end point to the end adress
  if(i<1 || i>(r.length)+1)
  {
    printf("i值不合法!");
    exit(0);
  }
  if(r.length >= r.listsize)
  {
    int sizeofInt = sizeof(int);
    int a =  ADDLIST + r.listsize;
    int size = a * sizeofInt;
    insert = (int *) realloc(r.p, size);
    r.p = insert;
    r.listsize += ADDLIST;
  }
  insert = r.p +i;  //insert是插入的位置
  for(end = r.p + (r.length-1); end>=insert; --end)// end point to the end adress
    *(end+1) = *end;
  *insert = insertValue;
  (r.length)++;
}

void outputSqList(SqList & r)
{
  int * temp = r.p;
  int * end = r.p + r.length - 1;
  for( ;  temp <= end; temp++)
    printf("%d", *temp);        
}

//此例子只能输入递增的元素
int main()
{
  SqList r;
  int n = 4; // size
  int x =  4;//value
  creatSqList(r,n); //n是线性顺序表的长度
  insert(r,x,findInsertPlace(r, x)); //x是要插入的值
  outputSqList(r);
  system("pause");
  return 0;
}
//欢迎多多来C++ 教室板块！！！