Matematické Fórum

rekurzivni_cyklus(unsigned int i; unsigned int max){   
   if(i<max) return rekurzivni_cyklus(i+1; max)
}

void quicksort (int a[], int l, int p)
{
    int i=l, j=p, pom;
    int x=a[(l+p)/2];

    do
    {
        while (a[i]<x) i++;
        while (a[j]>x) j--;
        if (i<=j)
        {
            pom=a[i]; a[i]=a[j]; a[j]=pom;
            i++; j--;
        }
    } while (i<=j);

    if (l<j) quicksort(a, l, j);
    if (i<p) quicksort(a, i, p);
}

int max(int *pole, int N, int i){ // N - velikost pole
   if(i==N-1) return i;
   else{
      int result = max(pole, N, i+1);
      if(pole[i]>pole[result]){
         result = i;
      }
      return result;
   }
}

void SelectSort(int *pole, int N){
   if(N<=1) return;
   else{
      int MaxIndex = max(pole, N, 0);
      int tmp = pole[N-1];
      pole[N-1] = pole[MaxIndex];
      pole[MaxIndex] = tmp;
      SelectSort(pole, N-1);
   }
}