static void Main(string[] args)
{
int[] arr = { 2, 8, 6, 14, 5, 4, 3, 9, 1, 17, 7 };
int n = arr.Length;
QuickSort qs = new QuickSort();
qs.Sort(arr);
//HeapSort ob = new HeapSort();
//ob.Sort(arr);
//var root = BinaryTree.CreateBinaryTree();
//BinaryTree.InOrder(root);
//var height = BinaryTree.Height(root);
//Console.WriteLine(height);
//Console.WriteLine(BinaryTree.LeftHeight + BinaryTree.RightHeight + 1);
//var v = int.Parse(Console.ReadLine());
//var g = new Graph(v);
//BFS Traversal
//g.AddEdge(1, 2);
//g.AddEdge(1, 10);
//g.AddEdge(2, 3);
//g.AddEdge(3, 4);
//g.AddEdge(3, 5);
//g.AddEdge(4, 24);
//g.AddEdge(5, 9);
//g.AddEdge(5, 6);
//g.AddEdge(6, 8);
//var queue = new Queue<int>();
//g.BFS(1, queue);
//BFS Traversal End
//Adding edges statically, in actual problem this has to be read from console.
//Number of disconnected components
//g.AddEdge(1, 2);
//g.AddEdge(3, 2);
//g.AddEdge(4, 3);
//g.AddEdge(6, 7);
//var queue = new Queue<int>();
//var disconnectedComponentCount = 0;
//for (int i = 1; i < v + 1; i++)
//{
// if (!g.visited[i])
// {
// disconnectedComponentCount++;
// g.BFS(i, queue);
// }
//}
//Console.WriteLine(disconnectedComponentCount);
Console.ReadKey();
}
private static void VerifyQuickSort()
{
int[] items = new int[] { 4, -2, 5, 6, 1, 2, 88 };
var sortedItems = QuickSort.Sort(items, 0, items.Length);
for (int cnt = 0; cnt < sortedItems.Length; cnt++)
{
Console.WriteLine(sortedItems[cnt]);
}
Console.ReadKey();
}
