private static void Main(string[] args)
{
//int[] input = new int[13] { 3, 2, 1, 4, 6, 10, 12, 5, 8, 11, 13, 7, 9 };
//int[] input2 = new int[7] { 45, 22, 37, 28, 55, 16, 38 };
int[] input3 = new int[8] {
2, 3, 4, 5, 6, 7, 10, 12
};
QuickSort_First.QuickSort(input3, 0, input3.Length - 1);
PrintArray.Print(input3);
Console.ReadKey();
//Quick_Sort_Pivot_Mid.QuickSortDecrease(ref input4, 0, input4.Length-1);
//Heap_Sort.HeapSort(ref input);
//input = Radix_Sort.RadixSort(input);
//PrintArray.Print(input);
//
//
TreeAA treeAA = new TreeAA();
for (int i = 0; i < 13; i++)
{
// treeAA.Insert(input[i]);
}
treeAA.Delete(1);
Console.WriteLine(treeAA.root.right.left.data);
///Console.WriteLine(treeAA.Search(100));
//treeAA.Delete(100);
// Console.WriteLine(treeAA.Search(100));
// Console.WriteLine(treeAA.root.right.right.right.data);
// PrintArray.PrintTest(input4);
//Linear_Exhaustive.LinearExhaustive(input2, 28);
// StackCus StackDemo = new StackCus(10);
// StackDemo.Push("a");
// StackDemo.Push("b");
//StackDemo.Pop();
// string peek = StackDemo.Peek();
// bool isEmpty = StackDemo.IsEmpty();
// Console.WriteLine(StackDemo.top);
// Console.WriteLine(peek);
// BTSTree treeDemo = new BTSTree(input[0]);
// for (int i =1; i< input.Length; i++)
// {
// treeDemo.InsertNodeIndex(input[i], i);
// }
// Console.WriteLine("text : {0}", treeDemo.NextSibling(4).data);
// int ind = treeDemo.Search(15);
// Console.WriteLine("Position in Array : {0}", ind);
Console.ReadLine();
BTSTree newTree = new BTSTree(5);
newTree.InsertNode(10);
newTree.InsertNode(3);
newTree.InsertNode(2);
newTree.InsertNode(4);
newTree.InsertNode(6);
newTree.InsertNode(7);
newTree.InsertNode(12);
int index = newTree.Search(16);
Console.WriteLine(index);
;
// Implement_Queue_Linked_List<int> queueLL = new Implement_Queue_Linked_List<int>();
// queueLL.Push(15);
//// queueLL.Push(25);
//queueLL.Push(30);
// queueLL.Push(55);
// Console.WriteLine("head1: {0}",queueLL.headQueue.next.data);
// Console.WriteLine("tail1: {0}", queueLL.Length);
// Console.WriteLine("peek: {0}",queueLL.Peek().data);
// Console.WriteLine("Pop: {0}",queueLL.Pop().data);
// Console.WriteLine("head2: {0}", queueLL.headQueue.data);
// Console.ReadLine();
//---check function CountingSort
// input = Counting_Sort.CountingSort(input);
//--Check function QuickSort
// input = Quick_Sort.QuickSort(input);
// input = Insertion_Sort.InsertionSort(input);
// input = Shell_Sort.ShellSort(input);
// int indexSearch = BinarySearch.BinarySearchRecursive(input, 0, 9, 4);
// Console.WriteLine(indexSearch);
// for (int i = 0; i< input.Length; i++)
// {
// Console.WriteLine(input[i]);
// }
Console.ReadLine();
}
static void Main(string[] args)
{
int[] input = new int[8] {
5, 3, 10, 2, 4, 6, 7, 12
};
int[] input2 = new int[7] {
45, 22, 37, 28, 55, 16, 38
};
int[] input3 = new int[6] {
1, 2, 6, 4, 7, 3
};
CreateAVL AVL_Tree = new CreateAVL();
for (int i = 0; i < input3.Length; i++)
{
AVL_Tree.InsertNode(input3[i]);
}
Console.WriteLine("Ket qua node: {0}", AVL_Tree.root.right.right.data);
//Linear_Exhaustive.LinearExhaustive(input2, 28);
// StackCus StackDemo = new StackCus(10);
// StackDemo.Push("a");
// StackDemo.Push("b");
//StackDemo.Pop();
// string peek = StackDemo.Peek();
// bool isEmpty = StackDemo.IsEmpty();
// Console.WriteLine(StackDemo.top);
// Console.WriteLine(peek);
// BTSTree treeDemo = new BTSTree(input[0]);
// for (int i =1; i< input.Length; i++)
// {
// treeDemo.InsertNodeIndex(input[i], i);
// }
// Console.WriteLine("text : {0}", treeDemo.NextSibling(4).data);
// int ind = treeDemo.Search(15);
// Console.WriteLine("Position in Array : {0}", ind);
Console.ReadLine();
BTSTree newTree = new BTSTree(5);
newTree.InsertNode(10);
newTree.InsertNode(3);
newTree.InsertNode(2);
newTree.InsertNode(4);
newTree.InsertNode(6);
newTree.InsertNode(7);
newTree.InsertNode(12);
int index = newTree.root.Search(12);
Console.WriteLine(index);
;
// Implement_Queue_Linked_List<int> queueLL = new Implement_Queue_Linked_List<int>();
// queueLL.Push(15);
//// queueLL.Push(25);
//queueLL.Push(30);
// queueLL.Push(55);
// Console.WriteLine("head1: {0}",queueLL.headQueue.next.data);
// Console.WriteLine("tail1: {0}", queueLL.Length);
// Console.WriteLine("peek: {0}",queueLL.Peek().data);
// Console.WriteLine("Pop: {0}",queueLL.Pop().data);
// Console.WriteLine("head2: {0}", queueLL.headQueue.data);
// Console.ReadLine();
//---check function CountingSort
// input = Counting_Sort.CountingSort(input);
//--Check function QuickSort
// input = Quick_Sort.QuickSort(input);
// input = Insertion_Sort.InsertionSort(input);
// input = Shell_Sort.ShellSort(input);
// int indexSearch = BinarySearch.BinarySearchRecursive(input, 0, 9, 4);
// Console.WriteLine(indexSearch);
for (int i = 0; i < input.Length; i++)
{
Console.WriteLine(input[i]);
}
Console.ReadLine();
}