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.
vector<int>countingSort(vector<int>arr){staticconstintcs=100;vector<int>c(cs);for(constint&a:arr){++c[a];}// if need to return sorted// int i = cs;// int n = arr.size() - 1;// while (i--)// {// while (c[i]--)// {// arr[n--] = i;// }// }// return arr;returnc;}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Counting Sort 1
You are viewing a single comment's thread. Return to all comments →