HOW TO SOLVE 4.5.3

Bismillahirohmanirohim
Assalamualikum w.w,

4.5.3 How To Solve

Program mengunakan Dev C++:

#include <iostream>

/* run this program using the console pauser or add your own getch, system("pause") or input loop */

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]);

  bucket_sort (input_ar, n);

 

  cout << "Sorted Array : " << endl;

  for (int i = 0; i < n; ++i)

    cout << input_ar[i] << " ";

 

return 0;

}

Gambar program nya:

Gambar outputnya:

Alhamdulillah 

Selamat mencoba dan semoga bermanfaat :)

Waalaikumsalam w.w.