Linked List bubbleSort problems

Question

I'm trying to implement a bubbleSort (with a insertionSort and selectionSort) on a linked list, but can't seem to get it working. Any tips on correcting the bubbleSort, and maybe some for the other two? Thanks!!!
public class sortingMethods {
public sortingMethods() {}
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 = list.getHead();
Node next = current.getNext();
Node temp;
int counter = 0;
boolean exchangeMade = true;
while(counter < (list.size() - 1) && exchangeMade) {
counter++;
exchangeMade = false;
for(int i = 1; i <= (list.size() - counter); i++) {
if(current.getData() > next.getData()) {
temp = current;
current = next;
next = temp;
exchangeMade = true;
public void selectionSort(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{}
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 {
public class LinkedList {
private Node head;
private int count;
public LinkedList() {
head = null;
count = 0;
public LinkedList(LinkedList rhs) {   //Copy constructor
head = rhs.head;
count = rhs.count;
public void orderedInsert(int item) {   //Inserts the Node in the right position - Ascending
Node back = null;
Node newNode = new Node(item);
Node pointer = head;
boolean found = false;
while(pointer != null && !found) {
if(pointer.getData() > item)
found = true;
else {
back = pointer;
pointer = pointer.getNext();
newNode.setNext(pointer);
if(back == null) {
head = newNode;
count++;
else {
back.setNext(newNode);
count++;
public void insert(int item) {   //Inserts at front of list
Node newnode = new Node(item);
if(head == null)
head = newnode;
else {
newnode.setNext(head);
head = newnode;
public void orderedRemove(int item) {   //Searches and removes selected Node
Node back = null;
boolean found = false;
Node pointer = head;
while(pointer != null && !found) {
if(pointer.getData() == item)
found = true;
else {
back = pointer;
pointer = pointer.getNext();
if(found)
if(back == null) {
head = pointer.getNext();
count--;
} else {
back.setNext(pointer.getNext());
count--;
} else
System.out.println("Data not found in list.");
public void remove() {   //Removes from front of list
if(head == null)
System.out.println("List is currently empty.");
else {
Node n = head;
head = head.getNext();
n.setNext(null);
count--;
public boolean isEmpty() {
if(head == null)
return true;
else
return false;
public void print() {
Node current = head;
while(current != null) {
System.out.println(current.getData());
current = current.getNext();
public int size() {return count;}
public Node getHead() {return head;}
} //End LinkedList class

Answer 1

I'm still having problems! Now the code just seems to go through an endless loop.
    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 {
            boolean exchangeMade = true;           
            int counter = 0;
            Node current = list.getHead();
            Node next = current.getNext();
            Node temp;
            while(counter < (list.size() - 1) && exchangeMade) {
                counter++;
                exchangeMade = false;
                for(int i = 1; i <= (list.size() - counter); i++) {
                    if(current.getData() > next.getData()) {
                        temp = current;
                        current.setNext(next);
                        next.setNext(temp);
                        exchangeMade = true;
    }And here is the rest of my code...
package cs321_assignment1;
public class LinkedList {   //Doubly Linked List
    private Node head;
    private int count;
    public LinkedList() {
        head = null;
        count = 0;
    public LinkedList(LinkedList rhs) {   //Copy constructor
        head = rhs.head;
        count = rhs.count;
    public void orderedInsert(int item) {   //Inserts the Node in the right position - Ascending
        Node back = null;
        Node newNode = new Node(item);
        Node pointer = head;
        boolean found = false;
        while(pointer != null && !found) {
            if(pointer.getData() > item)
                found = true;
            else {
                back = pointer;
                pointer = pointer.getNext();
        newNode.setNext(pointer);
        if(back == null) {
            head = newNode;
            count++;
        else {
            back.setNext(newNode);
            count++;
    public void insert(int item) {   //Inserts at front of list
        Node newnode = new Node(item);
        if(head == null)
            head = newnode;
        else {
            newnode.setNext(head);
            head = newnode;
        count++;
    public void orderedRemove(int item) {   //Searches and removes selected Node
        Node back = null;
        boolean found = false;
        Node pointer = head;
        while(pointer != null && !found) {
            if(pointer.getData() == item)
                found = true;
            else {
                back = pointer;
                pointer = pointer.getNext();
        if(found)
            if(back == null) {
            head = pointer.getNext();
            count--;
            } else {
            back.setNext(pointer.getNext());
            count--;
            } else
                System.out.println("Data not found in list.");
    public void remove() {   //Removes from front of list
        if(head == null)
            System.out.println("List is currently empty.");
        else {
            Node n = head;
            head = head.getNext();
            n.setNext(null);
            count--;
    public boolean isEmpty() {
        if(count == 0)
            return true;
        else
            return false;
    public void print() {
        Node current = head;
        while(current != null) {
            System.out.println(current.getData());
            current = current.getNext();
    public int size() {return count;}
    public Node getHead() {return head;}
    public void setHead(Node n) {head = n;}
} //End LinkedList class
package cs321_assignment1;
public class Node {
    private int data;
    private Node next;
    public Node() {next = null;}
    public Node(int d) {
        next = null;
        data = d;
    public int getData() {return data;}
    public void setData(int newData) {data = newData;}
    public Node getNext() {return next;}
    public void setNext(Node newNode) {next = newNode;}
}I can't figure this out, and I really need some help. Hopefully after I solve this, the selection and insertion sorts will be a little simpler. Any help will really be appreciated.