This is the final post about the MLUG Beer Money challenge: if you are lost, start here . The first solution method that I describe isn't particularly fast, but it is fun.
This is Part 2 of the beer money problem, see intro and Simple Nested Loops Solution (#1) . Recursion - yay. Having a VI that calls itself that calls itself that calls itself... then finally breaks out.
This post is about my first attempt at answering the MLUG beer money challenge outlined in this post . So, where to start? After grappling with this problem for a while, I decided to type up exactly what I was doing when trying to solve it on paper, and go from there.
I like a good coding challenge, and this one is particularly fun. It was set by the wonderful folks at MLUG and goes like this: I went to the supermarket to get some beers for the Euros final and my bill came to £11.99. With the money detailed [below], how many combinations are there that make up the exact change to pay my bill?
I was very shocked when I heard the news at work about NI binning NXG . NXG was announced back when I worked at NI and I still remember the excitement people had for a more modern LabVIEW - that "ooh" as they demo'd the zoom, those flashy web VIs.