int main(void)
{
struct Arr arr;
//int val;
int length;
printf("输入所需个数:");
scanf("%d",&length);
init_arr(&arr,length);
append_arr(&arr, 1);
append_arr(&arr, 7);
append_arr(&arr, 6);
append_arr(&arr, 4);
append_arr(&arr, 2);
sort_arr(&arr);
// if (delete_arr(&arr, 1, &val)) {
// printf("删除成功\n");
// printf("你删除的是：%d\n",val);
// } else {
// printf("删除失败\n");
// }
inversion_arr(&arr);
show_arr(&arr);
return 0;
}
int main(void)
{
int arr[20];
init_arr(arr, 20);
print_arr(arr, 20);
sort_arr(arr, 20);
print_arr(arr, 20);
return 0;
}
int main(void)
{
int arr1[] = { 3, 9, 6, 7 };
int arr2[] = { 2, 5, 5 };
int arr3[] = { 0 };
int arr4[] = { 1, 6 };
int arr5[] = { 4, 5, 6, 2, 1 };
int arr6[] = { 4, 2, 7, 1, 5 };
int arr7[] = { 4, 2, 5, 1, 6 };
int arr8[] = { 9, 12, 19, 18, 10, 28, 27, 15, 15, 27 };
int arr9[] = { 4, 2, 5, 1, 5 };
int *list[] = { arr1, arr2, arr3, arr4, arr5, arr6, arr7, arr8, arr9 };
enum { NUM_LIST = sizeof(list) / sizeof(list[0]) };
printf("Unsorted:\n");
print_arr(NUM_LIST, list);
sort_arr(NUM_LIST, list);
printf("Sorted:\n");
print_arr(NUM_LIST, list);
return 0;
}
