| 1 | import java.util.LinkedList; |
| 2 | public class MergeSort { |
| 3 | public static void mergeSort(LinkedList<Integer> ll) { |
| 4 | |
| 5 | |
| 6 | } |
| 7 | public static void main(String args[]) { |
| 8 | LinkedList<Integer> ll = new LinkedList<>(); |
| 9 | ll.addLast(4); |
| 10 | ll.addLast(3); |
| 11 | ll.addLast(2); |
| 12 | ll.addLast(1); |
| 13 | |
| 14 | System.out.println(ll); |
| 15 | } |
| 16 | } |
nothing calls this directly
no outgoing calls
no test coverage detected
searching dependent graphs…