Create Count Sort

[asmaurya95]

This is a Counting Sort Algorithm which can sort lists in linear time under certain constarints.
In this sort, we count the frequencies of distinct elements of array and store them in an auxiliary array, by mapping its value as index of auxiliary array and then place each element in its proper position in the output array .
Explaination :
Let the maximum element which can be in the array is max1 .
Now take an array having size of max1 +1 .Let it be Aux[0 ...max1] .
A[ ] = array whose elements are to be sorted (n elements ).
Out[ ] = array having sorted version of A[ ] .

[cdmh]

Thanks for the pull request. However, the code is not ready to be merged. The algorithm isn't in a reusable header file and no test/demo code is integrated into the existing cpp file.