Please help me in sorting consept for counting sort

[kailash_01 (kailash raturi)]

This is my code of sorting —>https://ide.codingblocks.com/s/360389

please correct me if i am wrong —>
1- This code complesity shuld be = o(k*n) ~= o(n)…
Then why we can use it as best sorting technique insted of nlog(n) …

[aman212yadav (Aman Yadav)]

hello @kailash_01

@kailash_01

please correct me if i am wrong —>

ur code is correct. but because u r using map ,it time complexity will not be linear.
it will be o(nlogn)

@kailash_01

1- This code complesity shuld be = o(k*n) ~= o(n)…
Then why we can use it as best sorting technique insted of nlog(n) …

assuming u are talking about standard counting sort.
it has limitation that the array size depends on the difference of max element and min element array.
if min is 1 and max is n^2 then array of n^2 size required which is too much.