/******************************************************************************
Welcome to GDB Online.
GDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,
C#, OCaml, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.
Code, Compile, Run and Debug online from anywhere in world.
*******************************************************************************/
#include <iostream>
using namespace std;
// A utility function to get maximum value in arr[]
int getMax(int arr[], int n)
{
int mx = arr[0];
for (int i = 1; i < n; i++)
if (arr[i] > mx)
mx = arr[i];
return mx;
}
// A function to do counting sort of arr[] according to
// the digit represented by exp.
void countSort(int array[], int n, int exp)
{
int output[n]; // output array
int i, count[10] = { 0 };
// Store count of occurrences in count[]
for (i = 0; i < n; i++)
count[(array[i] / exp) % 10]++;
// Change count[i] so that count[i] now contains actual
// position of this digit in output[]
for (i = 1; i < 10; i++)
count[i] += count[i - 1];
// Build the output array
for (i = n - 1; i >= 0; i--) {
output[count[(array[i] / exp) % 10] - 1] = array[i];
count[(array[i] / exp) % 10]--;
}
// Copy the output array to arr[], so that arr[] now
// contains sorted numbers according to current digit
for (i = 0; i < n; i++)
array[i] = output[i];
}
// The main function to that sorts arr[] of size n using
// Radix Sort
void radixsort(int array[], int n)
{
// Find the maximum number to know number of digits
int m = getMax(array, n);
// Do counting sort for every digit. Note that instead
// of passing digit number, exp is passed. exp is 10^i
// where i is current digit number
for (int exp = 1; m / exp > 0; exp *= 10)
countSort(array, n, exp);
}
// A utility function to print an array
void print(int array[], int n)
{
for (int i = 0; i < n; i++)
cout << array[i] << " ";
}
// Driver Code
int main()
{
using clock = std::chrono::steady_clock;
clock::time_point start = clock::now();
int array[] = {43, 34, 11, 19, 89, 62, 75, 58, 100, 22};
int n = sizeof(array) / sizeof(array[0]);
int i;
do{
for(int i = 0; i < 10; i++){
cout<<array[i]*10<<endl;
array[i]++;
}
}while(array[i] < 1000);
if(array[i] > 1000){
cout<<"continue the radix sort comparisions"<<endl;
radixsort(array, n);
}
// Function Call
radixsort(array, n);
print(array, n);
clock::time_point end = clock::now();
clock::duration execution_time = end - start;
return 0;
}
