static void PreviousTests()
{
Fibonacci fibonacci = new Fibonacci(9);
System.Console.WriteLine($"Fib 9 is :{Fibonacci.Fib(9)}");
System.Console.WriteLine($"Fib 9 is :{fibonacci.ComputeFib()}");
SimpleQueueGeneric <string> simpleQueue = new SimpleQueueGeneric <string>(2, 2);
simpleQueue.Enqueue("item1");
simpleQueue.Enqueue("item2");
simpleQueue.Enqueue("item3");
simpleQueue.Enqueue("item4");
simpleQueue.Enqueue("item5");
simpleQueue.Enqueue("item6");
simpleQueue.PrintQueue();
var item = simpleQueue.Dequeue();
System.Console.WriteLine($"Dequeued item is: {item}");
SingleLinkedListCustom <int> single = new SingleLinkedListCustom <int>();
single.InsertDefault(20);
single.InsertBegining(25);
single.PrintLinkedList();
var heapTestArray = new int[] { 4, 9, 1, 7, 5, 3 };
MaxHeap <int> heap = new CustomHeap.MaxHeap <int>(heapTestArray);
System.Console.WriteLine($"The Max Heap is:");
heap.PrintHeap();
heap.DeleteItem(0);
heap.PrintHeap();
MinHeap <int> minHeap = new MinHeap <int>(heapTestArray);
System.Console.WriteLine($"The Min Heap is:");
minHeap.PrintHeap();
minHeap.DeleteItem(0);
minHeap.PrintHeap();
var sortedAscending = HeapSortCustom <int> .SortAscending(heapTestArray);
var sortDesc = HeapSortCustom <int> .SortDescending(heapTestArray);
var sortedAscendingFromSpan = HeapSortCustom <int> .SortAscending(heapTestArray.AsSpan());
var sortDescFromSpan = HeapSortCustom <int> .SortDescending(heapTestArray.AsSpan());
var sortedName = HeapSortCustom <char> .SortDescending("aanderson");
}
public void TestSimpleGenericQueue()
{
SimpleQueueGeneric <string> simpleQueue = new SimpleQueueGeneric <string>(2, 3);
simpleQueue.Enqueue("item1");
simpleQueue.Enqueue("item2");
var item1 = simpleQueue.Dequeue();
Assert.False(simpleQueue.IsEmpty());
Assert.Equal("item1", item1);
var item2 = simpleQueue.Dequeue();
Assert.Equal("item2", item2);
Assert.True(simpleQueue.IsEmpty());
Assert.Throws <System.InvalidOperationException>(() =>
{
simpleQueue.Dequeue();
});
}
