Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdbool.h>
- #include <stdlib.h>
- #define G_MAX_SIZE 1000
- int Find_Counter(int Arr[], int No_Elements)
- {
- int counter = 0;
- int iterator;
- int max = 0;
- for (iterator = 1; iterator <= No_Elements; iterator++)
- {
- if (Arr[iterator] > max)
- {
- max = Arr[iterator];
- }
- }
- while (max != 0)
- {
- counter++;
- max = max / 10;
- }
- return counter;
- }
- void Radixsort (int Arr[], int No_Elements)
- {
- bool truth = true;
- int iterator;
- int temp;
- int a;
- int counter;
- int divider = 1;
- int min = 10;
- counter = Find_Counter(Arr, No_Elements);
- while(truth)
- {
- truth = false;
- for (iterator = 1; iterator <= No_Elements - 1; iterator++)
- {
- if (((Arr[iterator] / divider) % 10) > ((Arr[iterator+1] / divider) % 10 ))
- {
- temp = Arr[iterator];
- Arr[iterator] = Arr[iterator + 1];
- Arr[iterator + 1] = temp;
- truth = true;
- }
- }
- }
- }
- void display(int Arr[], int No_Elements)
- {
- int iterator;
- for (iterator = 1; iterator <= No_Elements ; iterator++)
- {
- printf ("A[%d] = %d\n", iterator, Arr[iterator]);
- }
- }
- int main()
- {
- int iterator;
- int Arr[G_MAX_SIZE];
- int No_Elements;
- printf ("How long do you want your vector to be ? ");
- scanf ("%d", &No_Elements);
- printf ("\n");
- for (iterator = 1; iterator <= No_Elements; iterator++)
- {
- printf ("Arr[%d] = ", iterator);
- scanf ("%d", &Arr[iterator]);
- }
- Radixsort (Arr, No_Elements);
- display (Arr, No_Elements);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement