If this is your first visit, be sure to
check out the FAQ by clicking the
link above. You may have to register
before you can post: click the register link above to proceed. To start viewing messages,
select the forum that you want to visit from the selection below.

Re: quickSort Algorithm

"john" <john@cs.uwindsor.ca> wrote:
>
>Can someone tell me where I can find how to impliment QuickSort Algorithm
>in Java. I just want to learn the technique and practice. I appreciate
>your help.
>
>john

1. If the number of elements in Sort is 0 or 1, them return.
2. Pick any element in Sort. This element is called the pivot.
3. Partition Sort-{element} (the remaining element is Sort) into two disjoint
groups. L and R.
4. Return the result of Quicksort(L), followed by Quicksort(R).

"john" <john@cs.uwindsor.ca> wrote:
>
>Can someone tell me where I can find how to impliment QuickSort Algorithm
>in Java. I just want to learn the technique and practice. I appreciate
>your help.
>
>john