{"id":3244,"date":"2022-09-21T16:38:49","date_gmt":"2022-09-21T11:08:49","guid":{"rendered":"https:\/\/cthecosmos.com\/?p=3244"},"modified":"2022-09-21T16:38:49","modified_gmt":"2022-09-21T11:08:49","slug":"the-simplicity-of-stack","status":"publish","type":"post","link":"https:\/\/cthecosmos.com\/?p=3244","title":{"rendered":"THE SIMPLICITY OF STACK<\/strong>"},"content":{"rendered":"\n

Stack, the most frequently used data structure. Stack<\/strong>, as the name suggests, keeps on stacking up the data one above the other. Consider an example of stacking up books in a box. The implementation of stack in your program is similar to that.<\/p>\n\n\n\n

Stack is often referred to as Last In First Out (LIFO<\/strong>). Why?\u00a0 Consider the same example of the books in box. You insert book by book in the box and would be able to remove the last placed book first and the first book you placed would be taken out last.

Stacks can be implemented using Arrays or Linked List. In this article, we shall see how it is implemented by using Arrays.<\/p>\n\n\n\n

\u00a0What are the operations to be performed to achieve this task? Visualize the books in the box. If the box is empty, you start loading it up with books. If it is full, you stop it and close the cover. And the inverse, you would unload unless there are no books left or until the book you are searching for is found.\u00a0 Use the same operations here, but let’s change the naming for simplicity. Push(), Pop(), PrintStack(). As the names suggest, Push() performs insertion of element into the stack, Pop() performs deletion of elements from the stack and PrintStack() just prints the stack.<\/p>\n\n\n\n

What do you do before adding the books? Make sure, the box has enough space. We use a similar analogy with the Push() operation. If the stack is full, Stop inserting the elements and let the user know that the stack is full. Let us also consider a variable top and initialize with -1 so that we can keep track of the topmost item.<\/p>\n\n\n

\n<pre class="wp-block-syntaxhighlighter-code">\nvoid pushStack()\n{\nif(top&lt;MAX-1){\n    int value;\n    printf("Enter the element: ");\n    scanf("%d",&amp;value);\n    ++top;\n    stack&#x5B;top]=value;\n    printf("Pushed....\\n");\n}\nelse{\n    printf("!!!!!!!! ERROR: Stack is overflown... !!!!!!!!\\n");\n}\n}\n<\/pre>\n<\/pre><\/div>\n\n\n
Here, top<\/strong> and the stack array<\/strong> are declared as global variables. Just check if the top is less than the MAX storage allocated in the array, as long as it is less, you are good to Push the values into the stack.\u00a0 If the top value exceeds, Throw an error message to the user. As you see, we are incrementing<\/strong> the top just before adding an element such that we are able to insert the values in the desired position i.e during the first push, we get
top=0, stack[0] \u00a0\u00a0\u00a0—– First Push
top=1, stack[1]\u00a0\u00a0\u00a0 —– Second Push
top=2, stack[2]\u00a0\u00a0\u00a0 —– Second Push \u2026 you see the pattern.
<\/p>\n\n\n\n
Time to remove the books from the box. Before doing that, just check if the box is empty, if it is, where would the book appear? Let’s go for the implementation using popStack()<\/strong> operation.<\/p>\n\n\n
\n<pre class="wp-block-syntaxhighlighter-code [code language="css"]">\nvoid popStack()\n{\n    if(top==-1)\n        printf("Stack is empty, cannot pop\\n");\n    else{\n        stack&#x5B;top]=0;\n        top--;\n        printf("Popped...\\n");\n    }\n}\n<\/pre>\n<\/pre><\/div>\n\n\n
As seen, we are just checking if the stack is empty, we are doing that by top==-1 . <\/strong>Since you need to pop the element that is currently being pointed by top, <\/strong>pop the element and then decrement<\/strong> the top value. Here I am just initializing the removed value by 0 and decrementing the top<\/strong>.<\/p>\n\n\n\n
Now, I want to see how many books are present in the box. For this, we are using the printStack()<\/strong> with a simple printf and printing the elements until the top. If there are no elements in the stack for printing, just print a simple error message.<\/p>\n\n\n
\n<pre class="wp-block-syntaxhighlighter-code">\nvoid printStack(){\n    if(top==-1)\n    printf("\\n~~~~~~~~~~~No elements to print~~~~~~~~~~~\\n");\n\n    else{\n        for (int i = top; i &gt;= 0; i--)    \n        printf("%d ",stack&#x5B;i]);\n    }\n\n}\n<\/pre>\n<\/pre><\/div>\n\n\n
\"\"
Illustration of Stack<\/figcaption><\/figure>\n\n\n\n
<\/p>\n\n\n\n
Using these three simple functions, a stack operation using arrays can be performed. Now let’s merge the code.<\/p>\n\n\n
\n<pre class="wp-block-syntaxhighlighter-code">\n#include&lt;stdio.h&gt;\n#include&lt;stdlib.h&gt;\n#define MAX 5\nint stack&#x5B;MAX];\nint count =0;\nint top = -1;\n\nvoid pushStack()\n{\n    \n    if(top&lt;MAX-1){\n        int value;\n        printf("Enter the element: ");\n        scanf("%d",&amp;value);\n        ++top;\n        stack&#x5B;top]=value;\n        printf("Pushed....\\n");\n    }\n    else{\n        printf("!!!!!!!! ERROR: Stack is overflown... !!!!!!!!\\n");\n    }\n}\n\nvoid popStack()\n{\n    if(top==-1)\n        printf("Stack is empty, cannot pop\\n");\n    else{\n        stack&#x5B;top]=0;\n        top--;\n        printf("Popped...\\n");\n    }\n}\n\nvoid  printStack(){\n    if(top==-1)\n    printf("\\n~~~~~~~~~~~No elements to print~~~~~~~~~~~\\n");\n\n    else{\n        for (int i = top; i &gt;=0  ; i--)    \n        printf("%d ",stack&#x5B;i]);\n    }\n\n}\n\nvoid main()\n{\n\ndo{\n    printf("Select and option\\n1)Push element\\t2)Pop Element\\t3)Print Stack\\n");\n    int choice;\n    scanf("%d",&amp;choice);\n    switch (choice)\n    {\n    case 1:\n            pushStack();\n            break;\n    case 2:\n            popStack();\n            break;\n    case 3:\n            printStack();\n            break;\n    default:\n        printf("Invalid Option\\n");\n        break;\n\n    }\n\n}while(1);\n}\n<\/pre>\n<\/pre><\/div>\n\n\n
From real-time undo, redo to actual stacking of function calls in the memory, the use of stack can be seen everywhere.

Feel free to modify and experiment<\/strong>. Thanks for reading. Happy learning.<\/p>\n","protected":false},"excerpt":{"rendered":"
Stack, the most frequently used data structure. Stack, as the name suggests, keeps on stacking up the data one above the other. Consider an example of stacking up books in a box. The implementation of stack in your program is similar to that. Stack is often referred to as Last In First Out (LIFO). Why?\u00a0 […]<\/p>\nRead More THE SIMPLICITY OF STACK<\/span><\/a>","protected":false},"author":120055267,"featured_media":3271,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_wpcom_ai_launchpad_first_post":false,"_jetpack_hide_featured_image":false,"_jetpack_featured_image_duplicate_dismissed":0,"_jetpack_feature_clip_id":0,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"{title}\n\n{excerpt}\n\n{url}","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2},"_wpas_customize_per_network":false,"jetpack_post_was_ever_published":false},"categories":[28627],"tags":[3378,584090,2426,167889,772321181,772321191,116003636,772321193,264,361344,196],"class_list":["post-3244","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-embedded","tag-algorithms","tag-arrays","tag-c","tag-c-language","tag-education","tag-embedded","tag-embedded-c-2","tag-embedded-systems","tag-learning","tag-linked-list","tag-programming","fallback-thumbnail"],"aioseo_notices":[],"aioseo_head":"\n\t\t\n\t\n\t\n\t\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t