best sorting algorithm

What would be the best sorting to algorithm for a list that is probably 90% sorted? I assume that quick sort wouldn't be the most efficient in this case.

EDIT: the list is made of strings. So i don't think any of the linear sorts will work.

Also, what sorting algorithm does Collections.sort() use?

[319 byte] By [rdevaa] at [2007-11-27 6:21:27]

«« binary tree toString() method
»» question abt rotate(double theta) from java.awt.Graphics2D

# 1

Quote from the javadocs:

The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n log(n) performance.

http://java.sun.com/javase/6/docs/api/java/util/Collections.html#sort(java.util.List)

gimbal2a at 2007-7-12 17:37:57 >

top of Java-index,Java Essentials,New To Java...

# 2

If the list is mostly sorted an insertion sort is probably the best.> EDIT: the list is made of strings. So i don't think any of the linear sorts will work.Why not?

ejpa at 2007-7-12 17:37:57 >

Java programming resources: FAQs, tutorials, compiler and browser download sites, documentation, books lists, IDEs, etc.

best sorting algorithm

Java Essentials New Topic

Java Essentials Hot Topic

Java Essentials

All Classified