{"id":11999,"date":"2023-01-25T08:41:10","date_gmt":"2023-01-25T08:41:10","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=11999"},"modified":"2023-09-22T08:24:49","modified_gmt":"2023-09-22T08:24:49","slug":"implementation-of-stack-using-array","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/implementation-of-stack-using-array\/","title":{"rendered":"Implementation Of Stack using Array"},"content":{"rendered":"

\"\"<\/p>\n

In this article, we will learn what is a stack, the algorithm for the implementation of stack using array, the algorithm of the stack with an example dry-run, the program for the implementation of stack using array, and the applications of stack.<\/p>\n

What is a Stack in Data Structures?<\/h2>\n

A stack represents a sequential arrangement of data, adhering to the last in, first out (LIFO) principle. Implementing the stack data structure requires a pointer known as "top." This top pointer is essential as it indicates the most recently added element, ensuring that the last inserted element can be retrieved.<\/p>\n

What is LIFO (Last In First Out) Strategy?<\/h3>\n

Following the last in, first out (LIFO) approach, the element that has been inserted most recently is the first to be extracted. An apt illustration of this principle can be observed with a stack of dinner plates. In this scenario, the uppermost plate is retrieved initially, followed by a sequential removal of the plates beneath it. This practical instance serves as a real-life demonstration of a stack.<\/p>\n

Algorithm for the Implementation of Stack using Array<\/h2>\n

Push:<\/strong> This function is used to insert a new element into the stack<\/p>\n

Algorithm to perform Push Operation:<\/h3>\n
    \n
  1. if the stack is full then return<\/li>\n
  2. else increment the value of the top pointer<\/li>\n
  3. assign the new value to stack[top]<\/li>\n<\/ol>\n

    Pop:<\/strong> This function is used to retrieve a topmost element from the stack<\/p>\n

    Algorithm to perform Pop Operation:<\/h3>\n
      \n
    1. if the stack is empty then return<\/li>\n
    2. else store the value of stack[top]<\/li>\n
    3. decrement the value of the top pointer<\/li>\n
    4. Return the stored value<\/li>\n<\/ol>\n

      Top:<\/strong> This function is used to get the top element from the stack.<\/p>\n

      Algorithm to perform Top Operation:<\/h3>\n
        \n
      1. if the stack is empty then return<\/li>\n
      2. else return stack[top]<\/li>\n<\/ol>\n

        isEmpty:<\/strong> This function is used to check whether the stack is empty or not.<\/p>\n

        Algorithm to Perform isEmpty Operation:<\/strong><\/p>\n

          \n
        1. if the top is greater than 1 then return true<\/li>\n
        2. else return false<\/li>\n<\/ol>\n

          Algorithm of the Stack with an example dry-run<\/h3>\n

          Now, we know what is stack and the algorithms of operations of the stack. Let\u2019s understand the implementation of stack using array with an example dry run.<\/p>\n

          First, we will take an empty array of capacity 5 and initialize a top variable with -1.<\/p>\n

          \"\"<\/p>\n

          Now, let\u2019s perform various operations to understand the working of the stack.<\/p>\n

          Operation: push(10)<\/strong>
          \nIn this push operation, first, we will check if the stack is full or not. If the stack is full we will not do anything. If the stack is not full then we will increment the variable top by 1. In this case, the stack is empty so we will increment the top by 1 and the top will become 0. Now, we will assign value 10 to stack[top].<\/p>\n

          \"\"<\/p>\n

          Operation: push(20)<\/strong>
          \nIn this push operation, we will insert new element 20 at the top of the stack. The stack is empty so we will increment the top by 1 and the top will become 1. Now, we will assign value 20 to stack[top].<\/p>\n

          \"\"<\/p>\n

          Operation: pop()<\/strong>
          \nIn this pop operation, first, we will check if the stack is empty or not. If the stack is empty we will not do anything. If the stack is not empty then we will store the value of stack[top] (20) in the temp variable. After that, we will decrement the value of the top by 1 so the top will become 0 and remove the top element from the array.<\/p>\n

          \"\"<\/p>\n

          Operation: push(30)<\/strong>
          \nIn this push operation, we will insert new element 30 at the top of the stack. The stack is empty so we will increment the top by 1 and the top will become 1. Now, we will assign the value 30 to stack[top].<\/p>\n

          \"\"<\/p>\n

          Operation: push(40)<\/strong>
          \nIn this push operation, we will insert new element 40 at the top of the stack. The stack is empty so we will increment the top by 1 and the top will become 2. Now, we will assign the value 40 to stack[top].<\/p>\n

          \"\"<\/p>\n

          Operation: push(50)<\/strong>
          \nIn this push operation, we will insert new element 50 at the top of the stack. The stack is empty so we will increment the top by 1 and the top will become 3. Now, we will assign the value 50 to stack[top].<\/p>\n

          \"\"<\/p>\n

          Operation: pop()<\/strong>
          \nIn this pop operation, first, we will check if the stack is empty or not. If the stack is empty we will not do anything. If the stack is not empty then we will store the value of stack[top] (50) in the temp variable. After that, we will decrement the value of the top by 1 so the top will become 2 and remove the top element from the array.<\/p>\n

          \"\"<\/p>\n

          Program for the Implementation of Stack using Array<\/h2>\n

          Let\u2019s see how to write a program for the implementation of stack using array.<\/p>\n\t\t\t\t\t\t