We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
@marioquiroga2912 Just brilliant !! But you are not doing what it says to do.
You are just appending the strings in the order they appear at their poisitions(which is a great idea though), here we have been told to implement counting sort.
So I implemented it, but my 5th test case is failing(Seg fault), which i think is due to memory limits.
i have used 3 arrays of size n(1<=n<=1000000), help please!
Here's my submission link mySubmission
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
The Full Counting Sort
You are viewing a single comment's thread. Return to all comments →
@marioquiroga2912 Just brilliant !! But you are not doing what it says to do. You are just appending the strings in the order they appear at their poisitions(which is a great idea though), here we have been told to implement counting sort. So I implemented it, but my 5th test case is failing(Seg fault), which i think is due to memory limits. i have used 3 arrays of size n(1<=n<=1000000), help please! Here's my submission link mySubmission