What is the method for sorting a linked list in Java?

There are several common methods for sorting linked lists in Java.

1. Bubble sort: Sorting method where larger elements are gradually moved to the end of a list by comparing adjacent elements and swapping their positions.
2. Insertion sort: Split the linked list into two parts – sorted and unsorted. Sort the list by inserting elements from the unsorted part into the correct position in the sorted part one by one.
3. Selection sort: each time, select the smallest (or largest) element from the list and place it at the end of the sorted portion, repeat this process until the list is fully sorted.
4. Merge sort: split the linked list in half, sort each sub-list, then merge the two sorted sub-lists into one ordered linked list.

These sorting methods can all be used in Java, the specific choice depending on the size of the linked list and sorting requirements.