struct listnode{
    int a;
    struct listnode *next;
};

void list_sort( struct listnode *list){
     int temp, f = 0;
     struct listnode *first;
     first = list;

     while(list->next != NULL){
         first = list->next;
         do{
             if(first->a < list->a){
                 temp = first->a;
                 first->a = list->a;
                 list->a = temp;
             }
             first = first->next;
         } while (first != NULL);
         list = list->next;
     }
}

void bucket_sort(int a[], int n){
     int *buckets,i,k;
     buckets = malloc(sizeof(int) * n);
   
     for (i = 0; i < n - 1; i++){
         buckets[msbits(a[i],k)]=a[i];
         //вставить A[i] в конец массива buckets[msbits(A[i], k)]
     }
     for (i = 0; i < n - 1; i++){
             bucket_sort(buckets[i],n);
     }
     //Конкатенация массивов buckets[0], ..., buckets[n-1]
}