Ai
1 Star 1 Fork 0

AndyZhang/C-Sharp-Algorithms

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
BucketSorter.cs 2.38 KB
一键复制 编辑 原始数据 按行查看 历史
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--;
}
}
}
}
}
}
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
C#
1
https://gitee.com/strongandyzhang/C-Sharp-Algorithms.git
git@gitee.com:strongandyzhang/C-Sharp-Algorithms.git
strongandyzhang
C-Sharp-Algorithms
C-Sharp-Algorithms
master

搜索帮助