How to Solve It by Computers 4.5

Algoritma :

var

A; array[1..100] of interger;

i: integer;

begin

for i:=1 to 100 do

begin

A[1]:=i;

end;

End

Program :

#include <iostream>
using namespace std;
 //Bucket Sort
void bucket_sort (int arr[], int n)
{
  //Here range is [1,100]
  int m = 101;
  //Create m empty buckets
  int buckets[m];
  //Intialize all buckets to 0
  for (int i = 0; i < m; ++i)
    buckets[i] = 0;
  //Increment the number of times each element is present in the input
  //array. Insert them in the buckets
  for (int i = 0; i < n; ++i)
    ++buckets[arr[i]];
  //Sort using insertion sort and concatenate
  for (int i = 0, j = 0; j < m; ++j)
    for (int k = buckets[j]; k > 0; --k)
      arr[i++] = j;
}
//Driver function to test above function
int main()
{
  int input_ar[] = {10, 24, 22, 62, 1, 50, 100, 75, 2, 3};
  int n = sizeof (input_ar) / sizeof (input_ar[0]);