KMP-看毛片算法

#include 
#include 

void insert(int *arr, int a, int n){ /*0到n-1都已排好序*/
 int i;
 int key = a;

 for(i=0; iif(key < arr[i]){
   int j;
   for(j=n-1; j>=i; j--){
    arr[j+1] = arr[j];
   }
   arr[i] = key;
   return;
  }
 }

 arr[n] = key;
 return;
}

void sort(int *arr, int size){
 if(size<2)
  return;
 int i;
 for(i=1; iint i, n, *arr;

 printf("请输入数组的大小 n = ");
 scanf("%d", &n);

 arr = (int*)malloc(sizeof(int)*n);

 printf("请输入%d个数组元素：\n", n);
 for(i=0; i"%d", &arr[i]);
 }

 printf("在排序前，数组为：");
 for(i=0; iprintf("%d ", arr[i]);
 }

 printf("\n调用排序函数中...\n");
 sort(arr, n);

 printf("在排序后，数组变为：");
 for(i=0; iprintf("%d ", arr[i]);
 }
 printf("\n");
 free(arr);
}