C#

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using GenericSearchLib;

namespace GenericSearch
{
    class GenericTest
    {
        private static GenericStack<int> intStack;
        private static GenericStack<double> doubleStack;
        private static int[] intArray;
        private static double[] doubleArray;
        private static int n;

        static void Main(string[] args)
        {
            Console.WriteLine("Enter a number of arraies what you want : "); //promt for user input
            string arrN = Console.ReadLine();
            n = Convert.ToInt32(arrN);

            if (n == 0)
                Console.WriteLine("Please enter the number is bigger than 0");
            else
                intStack = new GenericStack<int>(n);
                doubleStack = new GenericStack<double>(n);
                intArray = new int[n];
                doubleArray = new double[n];


                for ( int i = 0; i < intArray.Length; i++ )
                {
                    Console.WriteLine("Enter a integer for int array, one number as 1 : ");
                    string value = Console.ReadLine();
                    intArray[i] = Convert.ToInt32(value);
                }
                TestPush("intStack",intStack,intArray);
                Console.WriteLine();
                Console.WriteLine("-----------------Complete pusing the array-------------------");
                Console.WriteLine();

                for (int i = 0; i < doubleArray.Length; i++)
                {
                    Console.WriteLine("Enter a integer for double array, one double number as 2.00 : ");
                    string value = Console.ReadLine();
                    doubleArray[i] = Convert.ToDouble(value);
                }
                TestPush("doubleStack",doubleStack,doubleArray);
                Console.WriteLine();
                Console.WriteLine("-----------------Complete pusing the array-------------------");
                Console.WriteLine();

                Console.WriteLine();
                Console.WriteLine("-----------------Start searcing the array-------------------");
                Console.WriteLine();

                Console.WriteLine("Enter the name of array what you want to search, int or double : ");
                string arrName = Console.ReadLine();

                Console.WriteLine("Enter the keyword what you want to search : ");
                string keyword = Console.ReadLine();

                if(arrName == "int")
                    TestSearch(keyword, "Int Array", intStack);
                else
                    TestSearch(keyword, "Double Array", doubleStack);

        }

        private static void TestPush<T>(string name, GenericStack<T> stack, IEnumerable<T> elements)
        {
            // push elements onto stack
            try
            {
                Console.WriteLine("\nPushing elements onto " + name);

                // push elements onto stack
                foreach (var element in elements)
                {
                    Console.Write("{0} ", element);
                    stack.Push(element); // push onto stack
                } // end foreach
            } // end try
            catch (FullStackException exception)
            {
                Console.Error.WriteLine();
                Console.Error.WriteLine("Message: " + exception.Message);
                Console.Error.WriteLine(exception.StackTrace);
            } // end catch
        } // end method TestPush

        public static T To<T>(this string text)
        {
            return (T)Convert.ChangeType(text, typeof(T));
        }

        private static void TestSearch<T>(string searcKey, string name, GenericStack<T> stack)
        {
            int result=0;
            int savePosition=-1;
            try
            {
                for (int i = 0; i < n; i++)
                {
                    result = stack.Search(searcKey, i);
                    if (result != -1)
                        savePosition = result;
                }

                if (savePosition == -1)
                {
                    Console.WriteLine("Searching fail. Your keyword is not matched from array. -1");
                }
                else
                {
                    Console.WriteLine("Searching success. Keyword : {0} . Index(location) of array : {1}", searcKey, savePosition);
                }
            }
            catch (EmptyStackException exception)
            {
                Console.Error.WriteLine();
                Console.Error.WriteLine("Message: " + exception.Message);
                Console.Error.WriteLine(exception.StackTrace);
            }
        }

        // test Pop method
        private static void TestPop<T>(string name, Stack<T> stack)
        {
            // pop elements from stack
            try
            {
                Console.WriteLine("\nPopping elements from " + name);

                T popValue; // store element removed from stack

                // remove all elements from stack
                while (true)
                {
                    popValue = stack.Pop(); // pop from stack
                    Console.Write("{0} ", popValue);
                } // end while
            } // end try
            catch (EmptyStackException exception)
            {
                Console.Error.WriteLine();
                Console.Error.WriteLine("Message: " + exception.Message);
                Console.Error.WriteLine(exception.StackTrace);
            } // end catch
        } // end TestPop
    }
}

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace GenericSearchLib
{
    public class GenericStack<T>
    {
        private int top; //location of the top element
        private int position=0; //location of searching in array
        private T[] elements;

        public GenericStack()
            : this( 10 )
        {
            //empty constructor;
        }

        public GenericStack(int stackSize)
        {
            if (stackSize > 0) //check validate stackSize
                elements = new T[stackSize]; //create stackSize elements
            else
                throw new ArgumentException("Stack size must be positive.");

            top = -1; //stack initially empty
            position = 0; //default postion is zero as beginning of array
        }

        public void Push(T pushValue)
        {
            if (top == elements.Length - 1) //stack is full
                throw new FullStackException(String.Format("Stack is full, cannot push {0}", pushValue));

            ++top;
            elements[top] = pushValue;
        }

        public T Pop()
        {
            if (top == -1)
                throw new EmptyStackException("Stack is empty, cannot pop");

            --top;
            return elements[top + 1];
        }

        public int Search(string searckyKey, int position)
        {
            int reVal=-1;
            if (top == -1)
                throw new EmptyStackException("Stack is empty, cannot search");

            if (searckyKey.Equals(elements[position].ToString()))
            {
                reVal = position;
            }
            //++position;
                return reVal;
        }


        public void Display(string arrName)
        {
            Console.WriteLine( arrName + " ArrayList : " );

            int arrN = elements.Length - 1;
            foreach(var value in elements)
            {
                Console.WriteLine( "Location : {0}, Value : {1}", arrN, value);
                --arrN;
            }
        }
    }
}