On: Find running median from a stream of integers

[sixothree]

Heap sounds like overkill to find the middle value in a running list. What's wrong with simple stack and keeping track of how many integers you've received?

[xyzzyz → sixothree]

What's wrong with simple stack and keeping track of how many integers you've received?

I'm sorry, but I have absolutely no idea what you are talking about. Perhaps you could describe your solution a bit more.

[jbritto → sixothree]

I'm not sure what you have in mind (perhaps finding the mean? but why the stack?) but that would not work for median.

[Drbble → sixothree]

Your solution is for median position, not median value, and it would require a queue, not a stack, so unneeded old values could be dropped.

[sixothree → Drbble]

Of course, a queue is correct.