int leftptr left- /left (after ++int rightptr right/right- (after --while(true/find bigger item while(thearray[++leftptrpivot/(nop/find smaller item while(rightptr &thearray[--rightptrpivot/(nopif(leftptr >rightptrbreakelse swap(leftptrrightptr)/end while(trueswap(leftptrright)return leftptr/end partitionit(/if pointers cross/partition done /not crossedso /swap elements /restore pivot /return pivot location //public void swap(int dex int dex /swap two elements double temp thearray[dex ]/ into temp thearray[dex thearray[dex ]/ into thearray[dex temp/temp into /end swap///end class arrayins ///////////////////////////////////////////////////////////////class quicksort app public static void main(string[argsint maxsize /array size arrayins arrarr new arrayins(maxsize)/create array for(int = <maxsizej++/fill array with /random numbers double (int)(java lang math random()* )arr insert( )arr display()/display items arr quicksort()/quicksort them