Freeware zum Coden...

/*Quicksort in C*/
#define N 25
int a[N];

void sort(int L, int R) {
  int i, j, k, w, x;

  i = L; j = R; k = (L + R) / 2;
  x = a[k];
  do {
    while(a[i] < x)
      i++;
    while(a[j] > x)
      j--;
    if(i <= j) {
      w = a[i];
      a[i] = a[j];
      a[j] = w;
      i++; j--;
    }
  } while(i <= j);
  if(L < j)
    sort(L, j);
  if(R > i)
    sort(i, R);
}

void quicksort(void) {
  sort(0, n - 1);
}

%Quicksort in Prolog
gtq(X,Y) :- X @> Y.

quicksort( [],[] ).
quicksort( [X | Tail], Sorted) :-
        split( X, Tail, Small, Big),
        quicksort( Small, SortedSmall),
        quicksort( Big, SortedBig),
        conc( SortedSmall, [X | SortedBig], Sorted).

split( _, [], [], []).
split( X,[Y | Tail], [Y | Small], Big) :-
        gtq( X, Y),!,
        split( X, Tail, Small, Big).
split( X, [Y | Tail], Small, [Y | Big] ) :-
        split( X, Tail, Small, Big).

conc([],L,L).
conc( [X | L1], L2, [X | L3]) :-
        conc( L1, L2, L3).

/*Quicksort in Haskell (ob die Kommentarzeichen stimmen, weiß ich nicht)*/
quicksort([]) = []
quicksort(x:1) = quicksort(filter((< x),1)) ++ [x] ++ quicksort(filter((>=x),1))

filter(test,[]) = []
filter(test,x:1) = x: (filter(test,1))  if test(x)=true
                 = filter(test,1)       else