Counting sort in java with final array how? without no duplication?

int Comparing = 0;

while (Comparing < Cells.length)

{

int BeingCompared = 0;

while (BeingCompared < Cells.length)

{

if ((Cells [Comparing] < Cells [BeingCompared])

{

int First = Cells [Comparing];

int Second = Cells [BeingCompared];

Cells [Comparing] = Second);

Cells [BeingCompared] = First;

}

BeingCompared = BeingCompared + 1;

}

Comparing = Comparing + 1;

}

agentsteala at 2007-7-13 23:32:50 >

> int Comparing = 0;

> while (Comparing < Cells.length)

> ...

>Comparing = Comparing + 1;

I doubt that it is in the OP's best interest to post code that is

uncommented (not explained) to him/her, especially code

that will not compile.

prometheuzza at 2007-7-13 23:32:50 >