public static void QuickSortSplit(int E[])
{
int m=0; int n=E.length;

m=split(E);

if(m>1)
{
//QuickSortSplit(E[0..m-1]);
System.out.println("m>1:" + m);
}
if((n-m-1)>1)
{
System.out.println("n-m-1:" + (n-m-1));
//QuickSortSplit(E[m+1..n-1]);
}
}
public static int split(int E[])
{
int l=1;
int r=E.length-1;
int tmp;
while(l<=r)
{
while((l<=r) && (E[r]>E[0])) r--;
while((l<=r) && (E[l]<E[0])) l++;
if(l<r)
{
tmp = E[l];
E[l] = E[r];
E[r] = tmp;
l++;
r--;
}
}
if(r>0) {
tmp = E[0];
E[0] = E[r];
E[r] = tmp;
}
return r;
}
Hello, I am writing a sorting function, for some strange meta language there, and I have the problem of how to use what I wrote to call the function for QuickSortSplit QuickSortSplit (E [m +1 .. n-1]). How to complete these functions.