Sorting README file links updated

Author: me-shaon

Sorting/Bubble Sort/README.md

@@ -21,6 +21,5 @@ Starting from the beginning of the list, compare every adjacent pair, swap their
 - 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/)

Sorting/Insertion Sort/README.md

@@ -16,6 +16,5 @@
 - Best Case - O(n)
 
 ### More on this topic
-- https://en.wikipedia.org/wiki/Insertion_sort
-- http://quiz.geeksforgeeks.org/insertion-sort/
-- https://www.topcoder.com/community/data-science/data-science-tutorials/sorting/
+- [Insertion Sort - WikiPedia](https://en.wikipedia.org/wiki/Insertion_sort)
+- [Insertion Sort - geeksforgeeks](http://quiz.geeksforgeeks.org/insertion-sort/)

Sorting/Merge Sort/README.md

@@ -26,4 +26,3 @@ While comparing two sub-lists for merging, the first element of both lists is ta
 - [Merge Sort - Wikipedia](https://en.wikipedia.org/wiki/Merge_sort)
 - [Merge Sort - KhanAcademy Tutorial](https://www.khanacademy.org/computing/computer-science/algorithms/merge-sort/a/overview-of-merge-sort)
 - [Merge Sort - HackerEarch Tutorial](https://www.hackerearth.com/practice/algorithms/sorting/merge-sort/tutorial/)
-- [Sorting - TopCoder Tutorial](https://www.topcoder.com/community/data-science/data-science-tutorials/sorting/)

Sorting/Quick Sort/README.md

@@ -32,5 +32,4 @@ The principle of the quicksort algorithm is this:
 - [Quick Sort - KhanAcademy Tutorial](https://www.khanacademy.org/computing/computer-science/algorithms/quick-sort/a/overview-of-quicksort)
 - [Understanding Quicksort (with interactive demo)](http://me.dt.in.th/page/Quicksort/)
 - [Quick Sort - HackerEarch Tutorial](https://www.hackerearth.com/practice/algorithms/sorting/quick-sort/tutorial/)
-- [Sorting - TopCoder Tutorial](https://www.topcoder.com/community/data-science/data-science-tutorials/sorting/)
 - [Computer science in JavaScript: Quicksort](https://www.nczonline.net/blog/2012/11/27/computer-science-in-javascript-quicksort/)

Sorting/Selection Sort/README.md

@@ -20,6 +20,5 @@ If there are n elements to be sorted then, the process mentioned above should be
 - 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/)