代码拉取完成,页面将自动刷新
同步操作将从 编程语言算法集/C-Sharp 强制同步,此操作会覆盖自 Fork 仓库以来所做的任何修改,且无法恢复!!!
确定后同步将在后台操作,完成时将刷新页面,请耐心等待。
using System.Collections.Generic;
namespace Algorithms.Sorters.Comparison
{
/// <summary>
/// Class that implements pancake sort algorithm.
/// </summary>
/// <typeparam name="T">Type of array element.</typeparam>
public class PancakeSorter<T> : IComparisonSorter<T>
{
/// <summary>
/// Sorts array using specified comparer,
/// internal, in-place, stable,
/// time complexity: O(n^2),
/// space complexity: O(1),
/// where n - array length.
/// </summary>
/// <param name="array">Array to sort.</param>
/// <param name="comparer">Compares elements.</param>
public void Sort(T[] array, IComparer<T> comparer)
{
var n = array.Length;
// Start from the complete array and one by one
// reduce current size by one
for (var currSize = n; currSize > 1; --currSize)
{
// Find index of the maximum element in
// array[0..curr_size-1]
var mi = FindMax(array, currSize, comparer);
// Move the maximum element to end of current array
// if it's not already at the end
if (mi != currSize - 1)
{
// To move to the end, first move maximum
// number to beginning
Flip(array, mi);
// Now move the maximum number to end by
// reversing current array
Flip(array, currSize - 1);
}
}
}
// Reverses array[0..i]
private void Flip(T[] array, int i)
{
T temp;
var start = 0;
while (start < i)
{
temp = array[start];
array[start] = array[i];
array[i] = temp;
start++;
i--;
}
}
// Returns index of the maximum element
// in array[0..n-1]
private int FindMax(T[] array, int n, IComparer<T> comparer)
{
var mi = 0;
for (var i = 0; i < n; i++)
{
if (comparer.Compare(array[i], array[mi]) == 1)
{
mi = i;
}
}
return mi;
}
}
}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。