Selection sort README file and code comment updated and added in TOC

Author: me-shaon

README.md

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

Sorting/Selection Sort/README.md

@@ -9,17 +9,16 @@ Selection sort algorithm starts by compairing first two elements of an array and
 
 If there are n elements to be sorted then, the process mentioned above should be repeated n-1 times to get required result.
 
-#####A visualization on Selection Sort
+#### A visualization on Selection Sort
 ![Selection sort demonstration](https://upload.wikimedia.org/wikipedia/commons/9/94/Selection-Sort-Animation.gif)
 
 *Selection sort animation. Red is current min. Yellow is sorted list. Blue is current item.*
 
-####Complexity Analysis
+#### Complexity Analysis
 - Worst Case - O(n<sup>2</sup>)
 - Average Case - O(n<sup>2</sup>)
 - Best Case - O(n<sup>2</sup>)
 
 ### More on this topic
-- https://en.wikipedia.org/wiki/Selection_sort
-- http://quiz.geeksforgeeks.org/selection-sort/
-- https://www.topcoder.com/community/data-science/data-science-tutorials/sorting/
+- [Selection Sort - WikiPedia](https://en.wikipedia.org/wiki/Selection_sort)
+- [Selection Sort - geeksforgeeks](http://quiz.geeksforgeeks.org/selection-sort/)

Sorting/Selection Sort/Selection.java

@@ -1,4 +1,6 @@
-public class Selection 
+/* Selection Sort implementation in Java */
+
+public class Selection
 {
 	//Following function will sort the array in Increasing (ascending) order
     void sort(int arr[])