Update Bubble Sort (Iterative) Linked List

Author: akshayavb99

Course 2 - Data Structures in JAVA/Lecture 8 - Linked Lists II/Bubble Sort (Iterative) Linked List

@@ -30,3 +30,67 @@ Sample Input 2 :
 Sample Output 2 :
 -5 1 5 9 10 67 89 90 
 */
+
+/*
+
+	Following is the Node class already written for the Linked List
+
+	class LinkedListNode<T> {
+    	T data;
+    	LinkedListNode<T> next;
+    
+    	public LinkedListNode(T data) {
+        	this.data = data;
+    	}
+	}
+
+*/
+
+
+public class Solution {
+    
+    public static int findLengthLL(LinkedListNode<Integer> head)
+	{
+    	int count=0;
+    	while(head.next!=null)
+    	{
+        	head=head.next;
+        	count=count+1;
+    	}
+    	return count;
+    
+	}
+
+	public static LinkedListNode<Integer> bubbleSort(LinkedListNode<Integer> head) {
+		//Your code goes here
+        if (head==null || head.next==null)
+        {
+            return head;
+        }
+        int n=findLengthLL(head);
+        LinkedListNode<Integer> node1=null,node2=null,temp=null;
+        int data1=0,data2=0;
+        for (int i=0;i<n;i++)
+        {
+            node1=head;
+            node2=head.next;
+            for (int j=0;j<n-i;j++)
+            {
+                data1=node1.data;
+                data2=node2.data;
+                if (data1>data2)
+                {
+                    node1.data=data2;
+                    node2.data=data1;
+                }
+                node1=node1.next;
+                node2=node2.next;
+                
+            }
+            //Runner.print(head);
+        }
+        //System.out.println();
+        return head;
+        
+	}
+}