Stack

Question

Consider a stack and we wish to perform an operation StackDelete() in which we wish to delete all the elements of the stack .What is the worst case time complexity of doing this if stack is implemented:

1) Using an array

2)Using a Linked list

Comments

@VS

there array is dynamic array, where memory is allocated using malloc(). but generally by default we take static array in which memory is binded up throughout lifetime of a function(in which array is declared) or throughout lifetime of program(if array declared globally).

in case of static allocation deallocation of a array memory is not possible(i think so) because memory is allocated during compile time itself rather than runtime.

---

@joshi_nitish

I think then the answer depends on how memory is allocated to an array.

1) Dynamic --> StackDelete() -->O(1)

2)Static --> StackDelete() -->O(n)

But, what is the default case then ?

---

@VS

if asked in GATE, qsn will be properly framed avoiding any type of abguity that may arise