A new sorting approach for big data set: Hit sort

In this paper we are going to introduce a completely new sorting algorithm that is the hit sort(sorting by counting). Thus mathematically sorting means to sort the big data sets in less time and less memory space. Hit sort actually sorts the entire array in n square amount of time complexity. So we would we analyzing this algorithm and compare it with the existing algorithms.