代码拉取完成,页面将自动刷新
同步操作将从 编程语言算法集/C-Sharp 强制同步,此操作会覆盖自 Fork 仓库以来所做的任何修改,且无法恢复!!!
确定后同步将在后台操作,完成时将刷新页面,请耐心等待。
using System.Collections.Generic;
using System.Linq;
namespace Algorithms.Sorters.Comparison
{
/// <summary>
/// Divide and Conquer algorithm, which splits
/// array in two halves, calls itself for the two
/// halves and then merges the two sorted halves.
/// </summary>
/// <typeparam name="T">Type of array elements.</typeparam>
public class MergeSorter<T> : IComparisonSorter<T>
{
/// <summary>
/// Sorts array using merge sort algorithm,
/// originally designed as external sorting algorithm,
/// internal, stable,
/// time complexity: O(n log(n)),
/// space complexity: O(n),
/// where n - array length.
/// </summary>
/// <param name="array">Array to sort.</param>
/// <param name="comparer">Comparer to compare elements of <paramref name="array" />.</param>
public void Sort(T[] array, IComparer<T> comparer)
{
if (array.Length <= 1)
{
return;
}
var (left, right) = Split(array);
Sort(left, comparer);
Sort(right, comparer);
Merge(array, left, right, comparer);
}
private static void Merge(T[] array, T[] left, T[] right, IComparer<T> comparer)
{
var mainIndex = 0;
var leftIndex = 0;
var rightIndex = 0;
while (leftIndex < left.Length && rightIndex < right.Length)
{
var compResult = comparer.Compare(left[leftIndex], right[rightIndex]);
array[mainIndex++] = compResult <= 0 ? left[leftIndex++] : right[rightIndex++];
}
while (leftIndex < left.Length)
{
array[mainIndex++] = left[leftIndex++];
}
while (rightIndex < right.Length)
{
array[mainIndex++] = right[rightIndex++];
}
}
private static (T[] left, T[] right) Split(T[] array)
{
var mid = array.Length / 2;
return (array.Take(mid).ToArray(), array.Skip(mid).ToArray());
}
}
}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。