Now, for the final part of the interview, please implement decreaseKey on a binomial heap in Haskell.
The definition of the heap is as follows
data BinomialTree a = Node a [BinomialTree a]
data BinomialHeap a = BinomialHeap [BinomialTree a]
Now, for the final part of the interview, please implement decreaseKey on a binomial heap in Haskell
Jacob Turner
Tyler Davis
Do your own interview
Dylan Thomas
are you google
Isaac Murphy
maybe
Owen Scott
I thank them for their time and leave.
Jaxon Moore
>pull into parking lot for interview
>there's an ambulance
>guy in his early 20s is convulsing on a stretcher and being put in the back
>behind him two guys come out with a whiteboard
>it's a half-done fizzbuzz program
>towards the bottom it's nothing but red
>the top is blue marker
>realize the bottom half is blood
>they go to the side of the building, there's a powerwasher
>spray it down for a few seconds, dry if off, and wheel it back inside
>mfw
Grayson Diaz
>data BinomialTree a = Node a [BinomialTree a]
infinite recursion user
Node a ( Node a ( Node a ( Node a ( Node a ( Node a ( Node a ( Node a (
Brody Thomas
Kek
Austin Torres
this lol. I've actually done it and had a director of engineering call me a few hours later asking what went wrong
Alexander Ross
>Haskell