This is C++ program

#include #include #include using namespace std;

// Function to sort arr[] of // size n using bucket sort void bucketSort(float arr[], int n) { // 1) Create n empty buckets vector b[n];

// 2) Put array elements // in different buckets for (int i = 0; i < n; i++) { int bi = n * arr[i]; // Index in bucket b[bi].push_back(arr[i]); }

// 3) Sort individual buckets for (int i = 0; i < n; i++) sort(b[i].begin(), b[i].end());

// 4) Concatenate all buckets into arr[] int index = 0; for (int i = 0; i < n; i++) for (int j = 0; j < b[i].size(); j++) arr[index++] = b[i][j]; }

/* Driver program to test above function */ int main() { float arr[] = { 0.897, 0.565, 0.656, 0.1234, 0.665, 0.3434 }; int n = sizeof(arr) / sizeof(arr[0]); bucketSort(arr, n);

cout << "Sorted array is "; for (int i = 0; i < n; i++) cout << arr[i] << " "; return 0; }

Can you answer these questions

What is the input of your algorithm? What is the output of your algorithm? Where is the pseudocode? Where is the analysis part? What is the Runing time of your algorithm? try to recap. What is other real-world application of the algorithm or the idea you are using? Where is the visualization part? show it. What is the programming language you used in implementation? What is the input and the output in the output figures? White the figures captions clearly?