Пример #1
0
 static void Add(ref Stack ObjStack, ref Circular_Queue ObjQueue, ref char type)
 {
     Console.WriteLine("What does thou want to enter to the stack/queue (number please)?");
     int numInput;
     string input;
     bool valid = false;
     do
     {
         input = Console.ReadLine();
         if (Int32.TryParse(input, out numInput))
         {
             break;
         }
         else
         {
             Console.WriteLine("Please actually enter a number.");
         }
     } while (valid == false);
     if (type == 's')
     {
         ObjStack.push(numInput);
         Console.WriteLine("Value added to stack.");
     }
     else if (type == 'q')
     {
         ObjQueue.push(numInput);
         Console.WriteLine("Value added to queue.");
     }
     else
     {
         Console.WriteLine("No stack or queue initialised...");
     }
     Console.ReadLine();
 }
Пример #2
0
 static void Display(ref Stack ObjStack, ref Circular_Queue ObjQueue, ref char type)
 {
     if (type == 's')
     {
         Console.WriteLine(ObjStack);
     }
     else if (type == 'q')
     {
         Console.WriteLine(ObjQueue);
     }
     else
     {
         Console.WriteLine("No stack or queue initialised...");
     }
     Console.ReadLine();
 }
Пример #3
0
        static void Main(string[] args)
        {
            Random r = new Random();
            int[] data = new int[10];
            for (int i = 0; i < data.Length; i++)
            {
                data[i] = r.Next(0,99);
            }
            foreach (int item in data)
            {
                Console.Write("{0}, ", item);
            }
            Console.WriteLine("");
            Sort sort = new Sort();
            data = sort.Split(data);
            Console.WriteLine();
            foreach (int item in data)
            {
                Console.Write("{0}, ", item);
            }
            Console.ReadLine();
            char type = 'n';
            Stack ObjStack = new Stack(8);
            Circular_Queue ObjQueue = new Circular_Queue(8);

            int treeLength = 90000;
            Tree tree = new Tree(treeLength);
            for (int i = 0; i < treeLength; i++)
            {
                Console.Clear();
                tree.addNode(r.Next(0, 9000));
                Console.WriteLine(tree);

            }

            while (true)
            {
                Console.Clear();
                Console.Write("1. Initialise Stack \n2. Initialise Queue \n3. Add \n4. Remove \n5. Display All!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! \nSelection:");
                switch (Console.ReadLine())
                {
                    case "1": InitStack(ref ObjQueue, ref type); break;
                    case "2": InitQueue(ref ObjStack,ref type); break;
                    case "3": Add(ref ObjStack, ref ObjQueue, ref type); break;
                    case "4": Remove(ref ObjStack, ref ObjQueue, ref type); break;
                    case "5": Display(ref ObjStack, ref ObjQueue, ref type); break;
                    default: break;
                }
            }
        }
Пример #4
0
 static void InitStack(ref Circular_Queue ObjQueue, ref char type)
 {
     type = 's';
     Console.WriteLine("Stack will now be used.");
     Console.ReadLine();
 }
Пример #5
0
 static void Remove(ref Stack ObjStack, ref Circular_Queue ObjQueue, ref char type)
 {
     if (type == 's')
     {
         Console.WriteLine(ObjStack.pop());
         Console.WriteLine("Value popped from stack.");
     }
     else if (type == 'q')
     {
         Console.WriteLine(ObjQueue.pop());
         Console.WriteLine("Value popped from queue.");
     }
     else
     {
         Console.WriteLine("No stack or queue initialised...");
     }
     Console.ReadLine();
 }