radixsort(
inta[],
intn) {
8 int* output =
new int[n];
9memset(output, 0, n *
sizeof(*output));
10memset(count, 0,
sizeof(count));
12 for(
inti = 0; i < n; ++i) {
22 for(
intj = 0; j < maxdigits; j++) {
23 for(
inti = 0; i < n; i++) {
24 intt = std::pow(10, j);
25count[(a[i] % (10 * t)) / t]++;
28 for(
intp = 0; p < 10; p++) {
29 for(
inti = 0; i < n; i++) {
30 intt = std::pow(10, j);
31 if((a[i] % (10 * t)) / t == p) {
37memset(count, 0,
sizeof(count));
38 for(
inti = 0; i < n; ++i) {
45voidprint(
inta[],
intn) {
46 for(
inti = 0; i < n; ++i) {
47std::cout << a[i] <<
" ";
49std::cout << std::endl;
53 inta[] = {170, 45, 75, 90, 802, 24, 2, 66};
54 intn =
sizeof(a) /
sizeof(a[0]);
double k(double x)
Another test function.
int main()
Main function.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4