On Mar 8, 10:43 am, "Daniel Pitts" <googlegrou...@coloraura.com>
wrote:

Thanks Daniel,
I think there is something wrong with Arrays.sort() method. Let me
know if I am wrong instead
Consider the code below
--- Code ---
public void someMethod(){
int [] input = {1,4,-2,3,4,-1};
System.out.println("just input");
printArray(input);
System.out.println("Clone input before sorting");
printArray(inputClone);
Arrays.sort(inputClone);
System.out.println("Clone input after sorting");
printArray(inputClone);
}
public static void printArray(int [] input){
 System.out.print("[");
 for (int i=0;i<input.length;i++)
 System.out.print(input[i]+ ", ");
 System.out.println("]");
}
--- Code End ---

I get output as below
-- Output --
just input
[1, 4, -2, 3, 4, -1, ]
Clone input before sorting
[1, 4, -2, 3, 4, -1, ]
Clone input after sorting
[-2, -1, 1, 3, 4, 4, ]  <-- bug??
-- output End --
"<-- bug??" is of course not the part of output.
Hence I wrote filter2 method as follow which actually fails to give
the right output. I think that is due to this probable bug?
--- Code ---
public static int [] filter2(int [] input){
int [] output= new int[input.length];
int [] inputClone = input.clone();
int pos =0;
output[0]=inputClone[0];
for (int i=1;i<inputClone.length;i++){
  if (inputClone[i]!=inputClone[i-1]){
    output[++pos]=inputClone[i];
   }
 }
 int [] tempout=new int[pos];
 System.arraycopy(output, 0, tempout, 0, pos);
 return tempout;
}
--- Code End ---

@ John and @ Particia
Any pointers (like recommended online articles or book to brush up
these things quickly?) Or at least about "hashing"? I am looking at
JDK source code, but haven't been able to make much sense out of the
algorithms that they have used. I probably need to practice more, and
clear up some fundamentals.

Thanks
--
Ck
http://www.gfour.net