Is it possible to get a stack overflow while using quicksort in average running time?

Question

I know that this sounds stupid, but if we assume that we are lucky and get an average time complexity of O(NlogN) every single time for quick sort, then regardless of the size o

Answer 1

You cannot calculate this without having the number of elements you are considering for your input. Stack overflow error in this case would be a function of "number of elements" and "stack size". Out of these you are missing one.