- 论坛徽章:
- 0
|
递归函数quicksort里面没有判断左右范围大小,导致无穷递归,纠结了半天。闲来没事,写简单的数据结构,学学编程。- #include <stdio.h>
- int quichsort(int *arr, int left, int right);
- void swap(int *a, int *b);
- int
- main()
- {
- int arr[] = {9, 2, 1, 4, 3, 15, 11, 6, 7};
- int arr_len = sizeof(arr) / sizeof(arr[0]);
- int i;
- for (i = 0; i < arr_len; i++) {
- printf("%d ", arr[i]);
- }
- printf("\n");
- quicksort(arr, 0, arr_len - 1);
- for (i = 0; i < arr_len; i++)
- printf("%d ", arr[i]);
- printf("\n");
- return 0;
- }
- int
- quicksort(int *arr, int left, int right)
- {
- int i = left;
- int j = right;
- int one_key = arr[left];
- if (i >= j) //avoid infinity recursion
- return 0;
- while (i != j) {
- //accomplish one quicksort
- while (arr[j] > one_key) {
- j--;
- }
- swap(&arr[j], &one_key);
- while (arr[i] < one_key) {
- i++;
- }
- swap(&arr[i], &one_key);
- }
- quicksort(arr, left, i - 1); //accomplish the left remaining quicksort
- quicksort(arr, j + 1, right); //accomplish the right remaining quicksort
- }
- void
- swap(int *a, int *b)
- {
- int tmp;
- tmp = *a;
- *a = *b;
- *b = tmp;
- }
复制代码 |
|