Follow

Alright, I made a solution that actually works!

The challenge was to make a stack with a findMin function that could give you the smallest value in the stack in constant time.

This doesn't do that, but it does average better than just looking through the stack (although the tree isn't balanced, maybe I should do that...)

tagging @LottieVixen, who told me about the problem
computerfairi.es/media/GurlBHQ

@lizardsquid welps, I have no idea about haskell :p I need to call in help xD....do you wanna see my Java solution?

Sign in to participate in the conversation
Computer Fairies

Computer Fairies is a Mastodon instance that aims to be as queer, friendly and furry as possible. We welcome all kinds of computer fairies!