Search:

Thank you soo much :biggrin:

Of course it works.
Here is my implementation.


void selectionsort(int *niz, int n) {
int i;
for (i = 0; i < n - 1; i++) {
int j, tmp, maxi = i;
for (j = i + 1; j < n; j++) {
if...

I tried returning but it doesnt work,array is not sorted and some elements are missing.


void quicksort(int *array, int n) {
int pi;
if (n < 2)
return;
if(n<200){
...

No,it's not,but it doesn't work,because this is recursion and I am not good with recursion.
This is my code that doesn't work.


void quicksort(int *array, int n) {
int pi;
if (n < 2)
...

I need to modify qsort function.When array length(int n) is,for ex. 200, I need to use selectionsort instead of quicksort.Here is my quicksort implementation.


void quicksort(int *array, int n) {...