StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POInfinite computation of qsort
text
Body
copied!<p>i am realsing qsort algorithm, according on Korman. But there is infinite computation, when i trying to start it. I suppose, that problem is in partition. My programms reads from file, first number in file-line is counting of numbers to sort, and next go all numbers</p> <pre><code>#include <stdio.h> #include <stdlib.h> int swap(int &a, int &b); int sorting(int *array, int &b, int &l); int partition(int *array ,int &begin, int &last); int main() { FILE* pFile=fopen("input.txt", "r"); //fopen("input.txt", "r"); //fopen("output.txt", "w"); int n; int begin=0; fscanf(pFile, "%d", &n); int* array=(int*)malloc(n*sizeof(int)); for (int i=0; i<n; ++i) fscanf(pFile,"%d", &array[i]); int n1=n-1; sorting(array, begin, n1); printf("JJJJ"); for (int i=0; i<n; ++i) printf("%d ", array[i]); printf("\n"); fclose(pFile); free(array); return 0; } int sorting(int* array, int &b, int &l) { int pivot,pivot1; if(b<l) { pivot=partition(array, b, l); printf("MAXMAX321"); int a=pivot-1; sorting(array, b, a); printf("MAXMAX123"); pivot1=pivot+1; sorting(array, pivot1, l); printf("MAXMAX"); } return 0; } int partition(int* array, int &b, int &l) { int x=array[b]; int i=b; int j=l; while(true) { while(array[j]>x){ printf("AHAH"); --j; } while(array[i]<x){ printf("AZAZA"); ++i; } if(i<j) swap(array[i],array[j]); else return j; } } int swap(int &x, int &y) { x=x+y; y=x-y; x=x-y; return 0; } </code></pre> <p>Thank you in advance.</p>

Querying!

Guidance

An individual column

Larger individual text columns get their own page to allow for proper reading.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload