Insertion sorts and comparable

Question

HI guys. I need to refresh my memory for these two things, Insertion sorts and comparable.
I don't quite understand what is the different between insertion sorts and selection sorts.
And secondary, comparable. What is it for? How does it work? Here is the sample code. All I see is the use of it to call the compareTo method.
public static void main (Comparable[] objects)
for(int index=1; index < objects.length; index++)
Comparable key = objects[index];
int position = index;
//shift larger values to the right
while (position > 0 && objects[position-1].compareTo(key)>0)
objects[position] = objects[position-1];
position--;
}//end while
objects[] = key;
}//end for
Thanks a lot.

Answer 1

HI guys. I need to refresh my memory for these two
things, Insertion sorts and comparable.
I don't quite understand what is the different between
insertion sorts and selection sorts. They are different sorting algorithms.
(As you understand, I don't remember much either :) )
You're probably best off by finding a book about it.
And secondary, comparable. What is it for? How does it
work? Here is the sample code. All I see is the use of
it to call the compareTo method.Comparable is an interface that declares the compareTo-method. By using that general method you can write a general sorting method that are independent on what objects are being sorted and how they are being sorted, as long as they implement Comparable.