使用compareTo排序对象的双向链接列表的最佳方法是什么

Question

I have a doubly linked list of objects, and have a comparable interface in order to compare these objects. I'm just wondering, is there a standard/ best sort algorithm used to sort the list in this case?

thanks for any help!

Answer 1

You have a LinkedList<T extends Comparable> instance then the best way is to use the facility function Collections.sort .

If you have your custom data structure then you could make it implement the List<T> interface to be able to use the Collections methods (which includes sort and many others).