159 - The Full Counting Sort | Sorting | Hackerrank Solution | Python

159 - The Full Counting Sort | Sorting | Hackerrank Solution | Python

Hackers Realm

3 года назад

4,340 Просмотров

Ссылки и html тэги не поддерживаются


Комментарии:

sandy.g.cabanes
sandy.g.cabanes - 04.09.2023 16:44

Where did n come from?

Ответить
Armando Men
Armando Men - 05.11.2022 02:18

Thank you for the problem explanation, I'm doing this in java, I thought this problem was way harder than I thought, but how you explained it had much more sense than the description, and the problem is not as bad, but my complexity is n^2 which is sad but also interesting since I'm using two for loops to construct the string and print it out, everything else is O(n).

Thanks again, man.

Ответить
Cassian Kahema
Cassian Kahema - 30.04.2021 18:36

i was struggling with quick_sort. The code was correct but the complexity was too high ( ~ nlogn). I did not realize there was a faster solution. Thanks man

Ответить
Revan
Revan - 25.03.2021 18:00

I think hackerrank have some problem... end=' ' operator is not working... Correct me if I am wrong

Ответить