binary quicksort
- by davit-datuashvili
hi i want implement Binary quicksort algorithm from robert sedgewick book it looks like this
public class quickb{
public static final int bitsword=32;
public static void quicksortB(int a[],int l,int r,int d){
int i=l;
int j=r-1;
if (r<=l || d>bitsword) return ;
while (j!=i)
{
while (digit(a[i],d)==0 && (i<j)) i++;…