well i guess coz we need some more extra while we are searching..

like doing something if this certain condition was meet etc etc...

He can always implement Comparator interface to do virtually ANYTHING he want. So I wonder why he wants to reinvent the wheels... after all, libraries are tools which makes you NOT to redo what was already done.

Actually Arrays.sort() should work with any primitive data type

int, double, char, byte

as long as its an array of a primitive data types it should be able to sort it correctly

it will not sort objects of primitives ( Integer, Double ) you must use the primitive type

by the way if you were wondering wut sort Arrays.sort() uses i think its the Merge Sort

Actually you can sort any Objects. This means that Integer, Double and your own object can be sorted. Of course, when you use the primitive data type(int, double) you can just use the default, built-in function. For sorting other object, use the Comparator interface as mentioned by ykf. I also think that it uses Merge Sort, if i remember correctly.

Haha, I was about to post the same thing.

here's an example of the java api Arrays.sort in use




This post has been edited by jc804: Mar 7 2008, 11:47 PM

lets start with a bubble sort code in JAVA



This post has been edited by Umar Shah: Mar 28 2008, 10:20 PM

Next I'll try to demonstrate a relatively simpler sort called Selection sort;



in this example the inner loop just compares all the elements from position i to the end to find the mininmum one to be placed at position i,

the position determined by each iteration of outer loop.

This post has been edited by Umar Shah: Mar 28 2008, 10:37 PM

Now in this example i'll demonstrate one of my favourite O(n^2) sorts.
This one is called insertion sort.

[/code]
public class InsertionSort
{
public static void main(String args[])
{

int array[] = new int[10];
for (int i=0; i < array.length; i++){
array[i] = (int)(java.lang.Math.random()*100);
}
insertionSort(array);

for (int i=0; i < array.length; i++){
System.out.println("Val of array[" + i + "] = " +array[i] );
}

}

public static void insertionSort(int arr[])
{
int j=0;
for (int i=1; i<arr.length;)
{

if(arr[i]<arr[j]){
int tmp =arr[j];
arr[i]=arr[j];
arr[j]=tmp;
if(j>0){
j--;
}
else {
j=i;
i++;
}
}
else {
j=i;
i++;
}

}
}
}


[/code]


Although we dont have two nested loops in this example , nonetheless it worls like two nested loops.

the outer loop is only iterated if the present array upto position i is completely sorted. Otherwise j is decremented upto 0 so that the new element a[i] is inserted at its proper position in the partial array.

This is my code for an array sorter. It's quite efficient for counting too.



Unlike the code provided by the poster above, this one is very human-readable.

Names are people in my class.

xboxrulz