Advertisement
Guest User

Untitled

a guest
Mar 30th, 2017
80
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.75 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdbool.h>
  3. #include <stdlib.h>
  4.  
  5. #define G_MAX_SIZE 1000
  6.  
  7. int Find_Counter(int Arr[], int No_Elements)
  8. {
  9. int counter = 0;
  10. int iterator;
  11. int max = 0;
  12. for (iterator = 1; iterator <= No_Elements; iterator++)
  13. {
  14. if (Arr[iterator] > max)
  15. {
  16. max = Arr[iterator];
  17. }
  18. }
  19. while (max != 0)
  20. {
  21. counter++;
  22. max = max / 10;
  23. }
  24. return counter;
  25. }
  26.  
  27. void Radixsort (int Arr[], int No_Elements)
  28. {
  29. bool truth = true;
  30. int iterator;
  31. int temp;
  32. int a;
  33. int counter;
  34. int divider = 1;
  35. int min = 10;
  36. counter = Find_Counter(Arr, No_Elements);
  37.  
  38.  
  39. while(truth)
  40. {
  41.  
  42. truth = false;
  43. for (iterator = 1; iterator <= No_Elements - 1; iterator++)
  44. {
  45. if (((Arr[iterator] / divider) % 10) > ((Arr[iterator+1] / divider) % 10 ))
  46. {
  47. temp = Arr[iterator];
  48. Arr[iterator] = Arr[iterator + 1];
  49. Arr[iterator + 1] = temp;
  50. truth = true;
  51. }
  52. }
  53. }
  54. }
  55.  
  56. void display(int Arr[], int No_Elements)
  57. {
  58. int iterator;
  59. for (iterator = 1; iterator <= No_Elements ; iterator++)
  60. {
  61. printf ("A[%d] = %d\n", iterator, Arr[iterator]);
  62. }
  63.  
  64. }
  65.  
  66. int main()
  67. {
  68. int iterator;
  69. int Arr[G_MAX_SIZE];
  70. int No_Elements;
  71.  
  72. printf ("How long do you want your vector to be ? ");
  73. scanf ("%d", &No_Elements);
  74. printf ("\n");
  75.  
  76. for (iterator = 1; iterator <= No_Elements; iterator++)
  77. {
  78. printf ("Arr[%d] = ", iterator);
  79. scanf ("%d", &Arr[iterator]);
  80.  
  81. }
  82.  
  83. Radixsort (Arr, No_Elements);
  84. display (Arr, No_Elements);
  85.  
  86.  
  87. return 0;
  88. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement