代码拉取完成,页面将自动刷新
同步操作将从 编程语言算法集/C-Sharp 强制同步,此操作会覆盖自 Fork 仓库以来所做的任何修改,且无法恢复!!!
确定后同步将在后台操作,完成时将刷新页面,请耐心等待。
using System.Collections.Generic;
namespace Algorithms.Sorters.Comparison
{
/// <summary>
/// Cycle sort is an in-place, unstable sorting algorithm,
/// a comparison sort that is theoretically optimal in terms of the total
/// number of writes to the original array.
/// It is based on the idea that the permutation to be sorted can be factored
/// into cycles, which can individually be rotated to give a sorted result.
/// </summary>
/// <typeparam name="T">Type array input.</typeparam>
public class CycleSorter<T> : IComparisonSorter<T>
{
/// <summary>
/// Sorts input array using Cycle sort.
/// </summary>
/// <param name="array">Input array.</param>
/// <param name="comparer">Integer comparer.</param>
public void Sort(T[] array, IComparer<T> comparer)
{
for (var i = 0; i < array.Length - 1; i++)
{
MoveCycle(array, i, comparer);
}
}
private static void MoveCycle(T[] array, int startingIndex, IComparer<T> comparer)
{
var item = array[startingIndex];
var pos = startingIndex + CountSmallerElements(array, startingIndex + 1, item, comparer);
if (pos == startingIndex)
{
return;
}
pos = SkipSameElements(array, pos, item, comparer);
var temp = array[pos];
array[pos] = item;
item = temp;
while (pos != startingIndex)
{
pos = startingIndex + CountSmallerElements(array, startingIndex + 1, item, comparer);
pos = SkipSameElements(array, pos, item, comparer);
temp = array[pos];
array[pos] = item;
item = temp;
}
}
private static int SkipSameElements(T[] array, int nextIndex, T item, IComparer<T> comparer)
{
while (comparer.Compare(array[nextIndex], item) == 0)
{
nextIndex++;
}
return nextIndex;
}
private static int CountSmallerElements(T[] array, int startingIndex, T element, IComparer<T> comparer)
{
var smallerElements = 0;
for (var i = startingIndex; i < array.Length; i++)
{
if (comparer.Compare(array[i], element) < 0)
{
smallerElements++;
}
}
return smallerElements;
}
}
}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。