Sorting readme file added

Author: Shaon

Sorting/README.md

@@ -0,0 +1,12 @@
+#Sorting
+
+>A sorting algorithm is an algorithm that puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other algorithms (such as search and merge algorithms) which require input data to be in sorted lists; it is also often useful for canonicalizing data and for producing human-readable output. [wikipedia](https://en.wikipedia.org/wiki/Sorting_algorithm)
+
+
+
+###Useful Links:
+- [Nice animated visualization of sorting algorithms](https://www.cs.usfca.edu/~galles/visualization/ComparisonSort.html)
+- [Sorting visualization](https://visualgo.net/sorting)
+- [betterexplained.com article on Sorting algorithms](https://betterexplained.com/articles/sorting-algorithms/)
+- [Topcoder article](https://www.topcoder.com/community/data-science/data-science-tutorials/sorting/)
+- [Comparison of Sorting algorithms](https://en.wikipedia.org/wiki/Sorting_algorithm#Comparison_of_algorithms)