feat(bucket_sort): add bucket_sort code in go/c (#443)

* feat(bucket_sort): add bucket_sort code in go/c

* feat(go): add bucket_sort

* feat(c): add bucket_sort in c

* Update bucket_sort_test.go

---------

Co-authored-by: Yudong Jin <krahets@163.com>
This commit is contained in:
Reanon
2023-03-30 02:00:17 +08:00
committed by GitHub
parent 944c34982c
commit cac38c0c93
5 changed files with 107 additions and 14 deletions
+14 -14
View File
@@ -28,20 +28,20 @@ extern "C" {
static void printArray(int arr[], int size) {
printf("[");
if (arr != NULL && size != 0) {
for (int i = 0; i < size - 1; i++) {
if (arr[i] != NIL) {
printf("%d, ", arr[i]);
} else {
printf("NULL, ");
}
}
if (arr[size - 1] != NIL) {
printf("%d]\n", arr[size - 1]);
} else {
printf("NULL]\n");
}
for (int i = 0; i < size - 1; i++) {
if (arr[i] != NIL) {
printf("%d, ", arr[i]);
} else {
printf("NULL, ");
}
}
if (arr[size - 1] != NIL) {
printf("%d]\n", arr[size - 1]);
} else {
printf("NULL]\n");
}
} else {
printf("]");
printf("]");
}
}
@@ -138,7 +138,7 @@ static void printTree(TreeNode *root) {
* @param size
*/
static void printHeap(int arr[], int size) {
TreeNode * root;
TreeNode *root;
printf("堆的数组表示:");
printArray(arr, size);
printf("堆的树状表示:\n");