Bubble sort code comment and README file updated

Author: me-shaon

README.md

@@ -29,7 +29,7 @@
 
 - [Sorting](./Sorting/)
   - Selection Sort
-  - Bubble Sort
+  - [Bubble Sort](./Sorting/Bubble%20Sort)
   - Insertion Sort
   - Merge Sort
   - Quick Sort

Sorting/Bubble Sort/Bubble.java

@@ -1,11 +1,13 @@
+/* Bubble Sort implementation in Java */
 
-public class Bubble 
+public class Bubble
 {
+    //Simple Bubble Sort implementation
 	//Following function will sort the array in Increasing (ascending) order
     void sort(int arr[])
     {
         int n = arr.length;
-        
+
         for (int i = 0; i < n-1; i++)
         {
         	// Last i elements are already in place, so the inner loops will run until it reaches the last i elements
@@ -20,28 +22,29 @@ void sort(int arr[])
             }
         }
     }
-    
+
+    //Following is a slightly modified bubble sort implementation, which tracks the list with a flag to check if it is already sorted
     void modified_sort(int arr[])
     {
         int n = arr.length;
-        
+
         for (int i = 0; i < n-1; i++)
         {
         	boolean flag = false; //Taking a flag variable
-        	
-        	// Last i elements are already in place
+
+        	// Last i elements are already in place, so the inner loops will run until it reaches the last i elements
             for (int j = 0; j < n-i-1; j++)
             {
             	if (arr[j] > arr[j+1]) //To Sort in decreasing order, change the comparison operator to '<'
                 {
                     int temp = arr[j];
                     arr[j] = arr[j+1];
                     arr[j+1] = temp;
-                    
+
                     flag = true; //Setting the flag, if swapping occurs
                 }
             }
-            
+
             if(!flag) //If not swapped, that means the list has already sorted
             {
                 break;

Sorting/Bubble Sort/README.md

@@ -15,11 +15,11 @@ Starting from the beginning of the list, compare every adjacent pair, swap their
 
 ![Bubble sort gif](https://upload.wikimedia.org/wikipedia/commons/c/c8/Bubble-sort-example-300px.gif)
 
-####Complexity Analysis
+#### Complexity Analysis
 - Worst Case - O(n<sup>2</sup>)
 - Average Case - O(n<sup>2</sup>)
 - Best Case - O(n)
+
 ### More on this topic
-- http://en.wikipedia.org/wiki/Bubble_sort
-- http://quiz.geeksforgeeks.org/bubble-sort/
-- https://www.topcoder.com/community/data-science/data-science-tutorials/sorting/
+- [Bubble Sort](http://en.wikipedia.org/wiki/Bubble_sort)
+- [Bubble Sort](http://quiz.geeksforgeeks.org/bubble-sort/)