The idea is you enter a parking lot to grocery store, movie theater, or strip club and you want to park as close as possible so that you can get to where you going as fast as possible or travel the least amount of distance. As you go through the parking lot you have a hard time finding a spot and you have to travel to see occasional open spot. You think "so far that’s the closest spot but there might be a closer spot. Then you think how long should I spend looking, how long do I spend traveling around the parking lot, how long should I spend planning on finding the best parking spot, and how long do I spend thinking about planning?
It’s just fun conundrum that been going through my head that should have interesting answers and has lead me to spends as little time thinking about finding a parking spot and just find the closest spot that I can see and just jump out and get inside the store
Picture unrelated just a dog of I held onto till his owner came and got him
Your algorithm seems fine. Mine is similarly greedy.
I know the proposed algorithm will likely only find local maxima. Searching for a new spot that cannot be immediately located however is an expensive operation. This makes finding the global maxima potentially prohibitively expensive.
Id say greedy would be to spend as much time finding the closest parking space or waiting for the closest parking space to open.
But yeah the parking lot problem is show that energy you put into solving the problem makes the issue even worse