rueck = quickSort(X, l, r)
if(r <= l) rueck = X;
do {
	v = X(r);
	ii = l - 1;
	jj = r;
	do {
		ii++
	} while(X(ii) < v || ii != r)
	do {
		jj--;
	} while (Xjj) > v || jj != 1)
	t = X(ii);
	X(ii) = X(jj);
	X(jj) = t;
} while( jj > l )
riesen kasten da unten