diff --git a/docs/chapter_sorting/bucket_sort.md b/docs/chapter_sorting/bucket_sort.md index 4a9270947..c481e1ada 100644 --- a/docs/chapter_sorting/bucket_sort.md +++ b/docs/chapter_sorting/bucket_sort.md @@ -344,24 +344,20 @@ comments: true int k = n / 2; // 初始化 k = n/2 个桶 int *sizes = malloc(k * sizeof(int)); // 记录每个桶的大小 float **buckets = malloc(k * sizeof(float *)); // 动态数组的数组(桶) - + // 为每个桶预分配足够的空间 for (int i = 0; i < k; ++i) { - // 为每个桶预分配足够的空间 buckets[i] = (float *)malloc(n * sizeof(float)); sizes[i] = 0; } - // 1. 将数组元素分配到各个桶中 for (int i = 0; i < n; ++i) { int idx = (int)(nums[i] * k); buckets[idx][sizes[idx]++] = nums[i]; } - // 2. 对各个桶执行排序 for (int i = 0; i < k; ++i) { qsort(buckets[i], sizes[i], sizeof(float), compare); } - // 3. 合并排序后的桶 int idx = 0; for (int i = 0; i < k; ++i) { diff --git a/zh-Hant/docs/chapter_sorting/bucket_sort.md b/zh-Hant/docs/chapter_sorting/bucket_sort.md index d7c4eea25..7bea39b2a 100644 --- a/zh-Hant/docs/chapter_sorting/bucket_sort.md +++ b/zh-Hant/docs/chapter_sorting/bucket_sort.md @@ -344,24 +344,20 @@ comments: true int k = n / 2; // 初始化 k = n/2 個桶 int *sizes = malloc(k * sizeof(int)); // 記錄每個桶的大小 float **buckets = malloc(k * sizeof(float *)); // 動態陣列的陣列(桶) - + // 為每個桶預分配足夠的空間 for (int i = 0; i < k; ++i) { - // 為每個桶預分配足夠的空間 buckets[i] = (float *)malloc(n * sizeof(float)); sizes[i] = 0; } - // 1. 將陣列元素分配到各個桶中 for (int i = 0; i < n; ++i) { int idx = (int)(nums[i] * k); buckets[idx][sizes[idx]++] = nums[i]; } - // 2. 對各個桶執行排序 for (int i = 0; i < k; ++i) { qsort(buckets[i], sizes[i], sizeof(float), compare); } - // 3. 合併排序後的桶 int idx = 0; for (int i = 0; i < k; ++i) {