this post was submitted on 30 Nov 2023
1334 points (100.0% liked)

Programmer Humor

421 readers
44 users here now

Welcome to Programmer Humor!

This is a place where you can post jokes, memes, humor, etc. related to programming!

For sharing awful code theres also Programming Horror.

Rules

founded 1 year ago
MODERATORS
Feyter@programming.dev
anzo@programming.dev
BurningTurtle@programming.dev
pylapp@programming.dev
1334
Programmer tries to explain binary search to the police (startrek.website)
submitted 11 months ago by The_Picard_Maneuver@startrek.website to c/programmer_humor@programming.dev
60 comments fedilink hide all child comments
 
you are viewing a single comment's thread
view the rest of the comments
[–] potterman28wxcv 1 points 11 months ago (4 children)

I do not get why it would work in that case. I assume the scenario is someone with a bike coming, doing theft, then leaving with the same bike.

Therefore there will be a period without bike, then a period with bike, then a period without bike again.

Let's assume there is no bike on the particular moment viewed. How do you know whether it occured before or after the theft? If you make the wrong decision, you get stuck on an endless binary search.. Unless you take note at each timestamp where you made the decision, draw a tree of timestamps, and go back the tree if your search is fruitless but that's much more complicated than what this post says.

[–] Aatube@kbin.social 11 points 11 months ago (1 children)

To me it sounds like they stole the bike.

[–] potterman28wxcv 1 points 11 months ago

Thanks indeed I misunderstood the problem

load more comments (2 replies)