i need a simple implementation of sorting algorithm in linear time and efficient ? like radix sort or counting sort ? are they really better than merge sort ..if so why people always use nlogn algorithms ?