Scribd
Upload
44 views

ADS Lab Stack - NGE Stockspan

Applying a stack can help find the next greater element (NGE) for each element in a list. Elements are pushed to the stack and compared to the current element. If greater, the top is the NGE and popped. This continues until finding the NGEs for the whole list. Similarly, a stack can calculate stock span by pushing indices and popping when prices are less than or equal to the current element's price.

Uploaded by

Ashiqullah Yousufi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
44 views

ADS Lab Stack - NGE Stockspan

Applying a stack can help find the next greater element (NGE) for each element in a list. Elements are pushed to the stack and compared to the current element. If greater, the top is the NGE and popped. This continues until finding the NGEs for the whole list. Similarly, a stack can calculate stock span by pushing indices and popping when prices are less than or equal to the current element's price.

Uploaded by

Ashiqullah Yousufi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Application of Stack

Q1.
Given a linear list, print the Next Greater Element (NGE) for every
element. The NGE for an element x is the first greater element on the
right side of x in the list. Elements for which no greater element exist,
consider NGE as -1.

Examples:
a) For any list, rightmost element always has next greater element as -1.
b) For any list which is sorted in decreasing order, all elements have next
greater element as -1.
c) For the input list 4 -> 5 -> 2 -> 25 the next greater elements for each element are
as follows.
NGE of 4 is 5, NGE of 5 is 25
NGE of 2 is 25, NGE of 25 is -1
d) For the input list 13 -> 7 -> 6 -> 12 the NGE for each element are as follows.
NGE of 13 is -1, NGE of 7 is 12
NGE of 6 is 12, NGE of 12 is -1
1. Push the first element to stack.
2. Pick rest of the elements one by one and follow the below steps in loop.
a) Mark the current element as next.
b) If stack is not empty, then compare top element of stack with next.
i. If next is greater than the top element, then next is the NGE for the top element. Pop
the top element.
ii. Keep popping from the stack while the popped element is smaller than next. next
becomes the NGE for all such popped elements
c) Finally, push the next to the stack.
3. After the loop in step 2 is over, pop all the elements from stack and print -1 as NGE for them.
4 -> 5 -> 2 -> 25

next STK Action


4
5 5 next > top
Pop(4)
NGE of 4 is 5
Push(5)
2 5, 2 next is not > top
Push(2)
25 25 next > top
Pop(2); NGE of 2 is 25
Pop(5); NGE of 5 is 25
Push(25)
NGE of 25 is -1
Q2.
The stock span problem is a financial problem where we have a series of
daily price quotes for a stock and we need to calculate span of stock’s
price for all n days.

The span Si of the stock’s price on a given day i is defined as the maximum
number of consecutive days on or just before the given day i, for which the
price of the stock is less than or equal to its price on the given day i.

For example, if an array of 7 days prices is given as


100 80 60 70 60 75 85 then the span values for corresponding 7 days
are 1 1 1 2 1 4 6
100 80 60 70 60 75 85
Span(i) = i – Day_no(previous highest)
If no previous highest then Span(i)=i+1
100 80 60 70 60 75 85
• Push day# 0 (i.e. index 0) to stack.
• Set S0 as 1
• For i = 1 to n-1 repeat /* i is the index of the rest days */
• Pop the days when the price[tos] <= price[i]
• Set Si to i+1 if stack is empty; OR to i-stack[top] if the stack is not empty
• Push i on to the stack
i Price[i] STK Si Action
0 S0=1
1 80 0,1 S1=1 No pop
2 60 0,1,2 S2=1 No pop
3 70 0,1,3 S3=2 pop(2)
4 60 0,1,3,4 S4=1 No pop
5 75 0,1,5 S5=4 Pop(4)(3)
6 85 0,6 S6=6 Pop(5)(1)

You might also like