Ashutosh Maurya

Results 3 issues of Ashutosh Maurya

This is a Greedy Solution to the Activity Selection Problem ( Select from a list of choices the maximum no. of activities that can be done) The Solution is implemented...

Added Counting Sort , an another sorting algorithm that sorts in linear time.

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...