2434

Programmer tries to explain binary search to the police (startrek.website)

submitted 1 year ago by The_Picard_Maneuver@startrek.website to c/programmer_humor@programming.dev

362 comments fedilink hide all child comments

you are viewing a single comment's thread
view the rest of the comments

[-] null@slrpnk.net 55 points 1 year ago* (last edited 1 year ago)

But you will see the event happen though.

Not with a binary search.

Edit: just collapse this thread and move on. Cosmic Cleric is an obvious troll.

[-] tryagain@lemmy.ml 4 points 1 year ago

Well now I HAD to read the thread

What an absolute weirdo.

[-] CosmicCleric@lemmy.world 3 points 1 year ago* (last edited 1 year ago)

But you will see the event happen though.

Not with a binary search.

Yes you will.

A binary search is just what it says, it's just for searching only.

When you find that moment in time where the bike was there one moment, and then the next moment the bike's not there, then you view at regular or even slow-mo at those few seconds of the bike in the middle of disappearing, and see the perpetrator, and hopefully can identify them.

[-] Azzu@lemm.ee 33 points 1 year ago* (last edited 1 year ago)

You didn't get what was talked about here. Re-read the topmost parent comment.

How do you binary search for two people arriving, one punches the other, they both leave?

load more comments (62 replies)

[-] ShrimpsIsBugs@programming.dev 13 points 1 year ago

You either don't know what binary search is or you completely missed the context of this conversation

load more comments (11 replies)

[-] lustyargonian@lemm.ee 12 points 1 year ago

Binary search only works on sorted data, i.e. you know which side of the mid point is pointing towards the incident. If the incident leaves no trail, you can't know whether you can discard the left side or the right side, making it a complicated linear search at that moment.