代码拉取完成,页面将自动刷新
using System.Collections.Generic;
using System.Linq;
namespace Algorithms.Sorting
{
/// <summary>
/// Only support IList<int> Sort
/// </summary>
public static class BucketSorter
{
public static void BucketSort(this IList<int> collection)
{
collection.BucketSortAscending();
}
/// <summary>
/// Public API: Sorts ascending
/// </summary>
public static void BucketSortAscending(this IList<int> collection)
{
int maxValue = collection.Max();
int minValue = collection.Min();
List<int>[] bucket = new List<int>[maxValue - minValue + 1];
for (int i = 0; i < bucket.Length; i++)
{
bucket[i] = new List<int>();
}
foreach (int i in collection) {
bucket[i - minValue].Add(i);
}
int k = 0;
foreach (List<int> i in bucket) {
if (i.Count > 0)
{
foreach (int j in i)
{
collection[k] = j;
k++;
}
}
}
}
/// <summary>
/// Public API: Sorts descending
/// </summary>
public static void BucketSortDescending(this IList<int> collection)
{
int maxValue = collection[0];
int minValue = collection[0];
for (int i = 1; i < collection.Count; i++)
{
if (collection[i] > maxValue)
maxValue = collection[i];
if (collection[i] < minValue)
minValue = collection[i];
}
List<int>[] bucket = new List<int>[maxValue - minValue + 1];
for (int i = 0; i < bucket.Length; i++)
{
bucket[i] = new List<int>();
}
foreach (int i in collection)
{
bucket[i - minValue].Add(i);
}
int k = collection.Count-1;
foreach (List<int> i in bucket)
{
if (i.Count > 0)
{
foreach (int j in i)
{
collection[k] = j;
k--;
}
}
}
}
}
}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。