I wanted to have some data on how many people speed, the max speed recorded, that sort of thing. Things the city should be doing after many complaints of dangerous driving and people being almost killed on zebra crossings.
I have a doorbell camera, and by analysing the footage using OpenCV and some code, I can track how fast people drive if you see how fast they move between two known points.
Average speed: 46 km/h :(
You know, I got spoiled by Haskell, doing recursion everywhere without a care, and all I had to think was the evaluation order (when things blew up). Now that I'm doing some OCaml, I have to stop and think "am I writing a tail recursive function". It's easy to write multiple levels of recursion and lose track if you're writing a tail recursive function that the compiler will optimize.
I think recursions are really easy to make unbounded by mistake. Maybe not so much as for loops and off by ones.