Sorting Methods with Linked Lists

[Joel Cochran]

I'm trying to create 3 different sorting methods (bubble, selection, insertion) that sorts the data in a linked list (custom made). I'm having big time problems with the selection and insertion. I've seen how to do this with arrays, but I just can't seem to make the swap to linked list. I've managed to get the bubble sort to work, but can't seem to get the other two (in fact, I haven't got anything for insertion yet). Here's what I have so far...

    
public void bubbleSort(LinkedList list) {
        if(list.isEmpty())
            System.out.println("List is currently empty.");
        else if (list.size() == 1)
            System.out.println("List is already sorted.");
        else {
            Node current;
            Node counter = list.getFirst();
            boolean exchangeMade = true;
            int iterationsINNER = 1, iterationsOUTER = 1, swaps = 0, comparisons = 1;
           
            while(counter.getNext().getNext() != null && exchangeMade) {
                current = list.getFirst();
                exchangeMade = false;
                iterationsOUTER++;
                while(current.getNext() != null) {
                    if(current.getData() > current.getNext().getData()) {
                        int temp = current.getData();
                        current.setData(current.getNext().getData());
                        current.getNext().setData(temp);
                        exchangeMade = true;
                        swaps++;
                        comparisons++;
                    }
                    current = current.getNext();
                    iterationsINNER++;
                }
                counter = counter.getNext();
            }
            System.out.println("Comparisons: " + comparisons + " \nSwaps: " + swaps + " \nIterations: " + iterationsINNER+iterationsOUTER);
        }
    }
    
    public void selectionSort(LinkedList list) {
        int iterationsINNER = 1, iterationsOUTER = 1, swaps = 0, comparisons = 1;
        if(list.isEmpty())
            System.out.println("List is currently empty.");
        else if (list.size() == 1)
            System.out.println("List is already sorted.");
        else {
            Node pointer = list.getFirst();
            Node current;
            boolean swapMade = false;
            int temp = 0;
            while (pointer.getNext() != null) {
                current = pointer;
                iterationsOUTER++;
                while (current.getNext() != null) {
                    comparisons++;
                    if(current.getNext().getData() < pointer.getData()) {
                        temp = pointer.getData();
                        swapMade = true;
                    }
                    current = current.getNext();
                }
                if(swapMade) {
                    pointer.setData(current.getData());
                    current.setData(temp);
                }
                pointer = pointer.getNext();
            }
            System.out.println("Comparisons: " + comparisons + " \nSwaps: " + swaps + " \nIterations: " + iterationsINNER+iterationsOUTER);
        }
    }
    
    public void insertionSort(LinkedList list){
        if(list.isEmpty())
            System.out.println("List is currently empty.");
        else if (list.size() == 1)
            System.out.println("List is already sorted.");
        else{}
    }

Any ideas on what's wrong with the selection sort, and any hints for the insertion? Thanks for all your help!