public void ReverseKIntervalsTest()
{
var nodeToBeSorted = CreateList();
var mergeSortHelper = new MergeSortHelper();
var answer = mergeSortHelper.ReverseKIntervals(nodeToBeSorted, 1);
var debugStopper = answer.ToString();
}
// Update is called once per frame
void Update()
{
if (Input.GetKeyDown(KeyCode.A))
{
Debug.Log("aaaaaaaaaaaaaaaaaaa");
List <int> temp = new List <int>();
temp.AddRange(data);
PerformanceHelper.WatchPerformance("归并排序算法效率 ", () => { MergeSortHelper.Sort <int>(data, 0, data.Count - 1, CompareRather, temp); });
}
}
public void MergeListsHelperTests()
{
var node1 = new SinglyLinkedListNode <int>(1);
var head1 = node1;
var node2 = node1.Next = new SinglyLinkedListNode <int>(3);
var node3 = node2.Next = new SinglyLinkedListNode <int>(5);
var node4 = new SinglyLinkedListNode <int>(4);
var head2 = node4;
var node5 = node4.Next = new SinglyLinkedListNode <int>(2);
var mergedHead = new MergeSortHelper().MergeAlternating(head1, head2);
mergedHead.GetType();
}
public void MergeSortHelperTests()
{
var nodeToBeSorted = CreateList();
var mergeSortHelper = new MergeSortHelper();
var sortedHead = mergeSortHelper.MergeSort(nodeToBeSorted);
Assert.AreEqual(sortedHead.Data, 1);
Assert.AreEqual(sortedHead.Next.Data, 3);
Assert.AreEqual(sortedHead.Next.Next.Data, 4);
Assert.AreEqual(sortedHead.Next.Next.Next.Data, 6);
Assert.AreEqual(sortedHead.Next.Next.Next.Next.Data, 9);
Assert.AreEqual(sortedHead.Next.Next.Next.Next.Next.Data, 11);
Assert.AreEqual(sortedHead.Next.Next.Next.Next.Next.Next.Data, 18);
}
