Why comparison based algorithms cannot sort in less than O(nlogn). And why counting sort, radix sort and bucket sort can do better.
Reagrding the statement "The intuition is to count the frequency of each key and then place the corresponding items in their correct positions based on their values and frequencies. " in counting sort section, is it frequency of keys or items.
Are we supposed to be T shaped employees or V shaped employees?
Reagrding the statement "The intuition is to count the frequency of each key and then place the corresponding items in their correct positions based on their values and frequencies. " in counting sort section, is it frequency of keys or items.
Are we supposed to be T shaped employees or V shaped employees?