#include <iostream> #include <algorithm> #include <vector> using namespace std; int partition(int a[], int left, int right) { int pivot = a[left]; while (true) { while (a[left] < pivot) left++; while (a[right] > pivot) right--; if (left < right) { swap(a[left], a[right]); } else { return right; } } } void quicksort(int a[], int left, int right) { if (left < right) { int pivot = partition(a, left, right); quicksort(a, left, pivot-1); //Warum findet hier kein Aufruf statt. pivot=0! // quicksort(a, pivot+1, right); } } void main(void) { int thearray[]={2 ,15, 9 ,5}; quicksort(thearray,0,3); for (int i=0; i<4; ++i) { cout << thearray[i] << " "; } cout << endl; } ]]>https://www.c-plusplus.net/forum/topic/258828/quicksort-2RSS for NodeWed, 09 Sep 2026 03:05:30 GMTFri, 15 Jan 2010 16:02:01 GMT60#include <iostream> #include <algorithm> #include <vector> using namespace std; int partition(int a[], int left, int right) { int pivot = a[left]; while (true) { while (a[left] < pivot) left++; while (a[right] > pivot) right--; if (left < right) { swap(a[left], a[right]); } else { return right; } } } void quicksort(int a[], int left, int right) { if (left < right) { int pivot = partition(a, left, right); quicksort(a, left, pivot-1); //Warum findet hier kein Aufruf statt. pivot=0! // quicksort(a, pivot+1, right); } } void main(void) { int thearray[]={2 ,15, 9 ,5}; quicksort(thearray,0,3); for (int i=0; i<4; ++i) { cout << thearray[i] << " "; } cout << endl; } ]]>https://www.c-plusplus.net/forum/post/1839391https://www.c-plusplus.net/forum/post/1839391Fri, 15 Jan 2010 16:02:01 GMTsry hat sich schon erledigt. Es tritt die Abbruchbedingung in Kraft.

]]>https://www.c-plusplus.net/forum/post/1839426https://www.c-plusplus.net/forum/post/1839426Fri, 15 Jan 2010 17:22:14 GMT