// implementation of LSD Radix Sort
#include <vector>
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
 
// structure for a single linked list to help further in the
// sorting
struct node {
    int data;
    node* next;
};
 
// function for creating a new node in the linked list
struct node* create(int x)
{
    node* temp = new node();
    temp->data = x;
    temp->next = NULL;
 
    return temp;
}
 
// utility function to append node in the linked list
// here head is passed by reference, to know more about this
// search pass by reference
void insert(node*& head, int n)
{
    if (head == NULL) {
        head = create(n);
        return;
    }
 
    node* t = head;
    while (t->next != NULL)
        t = t->next;
    t->next = create(n);
}
 
//The utility function to sequentially output the data of the nodes on the link list from the beginning to the end
void printlist(node* head){
    if (head == NULL){
        cout<<"NULL"<<endl;
        return ;
    }
    node* temp = head;
    do {
        cout<<temp->data<<" ";
        temp = temp->next;
    } while (temp != NULL);
    cout<<endl;
}
 
// utility function to pop an element from front in the list
// for the sake of stability in sorting
int del(node*& head)
{
    if (head == NULL)
        return 0;
    node* temp = head;
    // storing the value of head before updating
    int val = head->data;
 
    // updation of head to next node
    head = head->next;
 
    delete temp;
    return val;
}
 
// utility function to get the number of digits in the
// max_element
int digits(int n)
{
    //TODO
}
 
void radix_sort(vector<int>& arr)
{
    //TODO
}
 
// a utility function to print the sorted array
void print(vector<int> arr)
{
    for (int i = 0; i < arr.size(); i++)
    cout << arr[i] << " ";
    cout << endl;
}
 
int main()
{
    vector<int> arr;
 
    int a;
    int b;
    cin>>a;
    for (int i = 0;i<a;i++){
        cin>>b;
        arr.push_back(b);
    }
    // function call
    radix_sort(arr);
    print(arr);
 
    return 0;
}

for (int k = 0;k<10;k++){
    cout<<k<<" ";
    printlist(your_bin_array_name[k]);
}

// creating buckets to store the pointers

node** bins;

 

// array of pointers to linked list of size 10 as

// integers are decimal numbers so they can hold numbers

// from 0-9 only, that's why size of 10

 

bins = new node*[10];

 

// initializing the hash array with null to all

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

bins[i] = NULL;