[Algorithm daily practice] bucket sort

"Problem": if there is a set of data a[]={0,9,2,3,4,5,3,5,2,8}, order it from small to large

#include <stdio.h>void bucketsort () {int i, j;int a[] = {0,9,2,3,4,5,3,5,2,8};int B[10] = {0};int iasize = sizeof (a)/ sizeof (int), int ibsize = sizeof (b)/sizeof (int); for (i=0; i<iasize; i++) {b[a[i]]++;} for (i=0; i<iasize; i++) {for (j=0; j<b[i]; J + +) {printf ("%d", I);}} printf ("\ n");} int main () {Bucketsort ();}

　　

To talk about the complexity of the problem, the complexity O (m+n) of the bucket, where m represents the number of buckets, n indicates the number to be sorted, that is, O (m+n).

[Algorithm daily practice] bucket sort