BucketSort

bucketSort.cpp

#include <iostream>
using namespace std;

void print(int *arr, int n) {
    for(register int i=0; i<n; i++) {
        cout<<arr[i]<<" ";
    }
}

void bucketSort(int *arr, int n) {
    int bucketSize = 0;
    for(register int i=0; i<n; i++) {
        if (arr[i] > bucketSize) {
            bucketSize = arr[i];
        }
    }

    bucketSize++;
    int arr2[bucketSize];
    for(register int i=0; i<bucketSize; i++) {
        arr2[i] = 0;
    }
    for(register int i=0; i<n; i++) {
        arr2[arr[i]]++;
    }

    int i=0, j=0;
    while(i < n) {
        while(arr2[j] > 0) {
            arr[i] = j;
            arr2[j]--;
            i++;
        }
        j++;
    }
    print(arr, n);
}


int main() {
    int arr[] = {5, 6, 0, 13, 3, 2, 8, 7, 4};
    int n = 9;
    bucketSort(arr, n);
    return 0;
}