2547
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
411 comments fedilink hide all child comments
you are viewing a single comment's thread
view the rest of the comments
[-] skydivekingair@lemmy.world 7 points 11 months ago* (last edited 11 months ago)

For those looking for the handout:

person: A B C D E F G H I J K L

round 1: L L L L R R R R — — — -

round 2: L L R R R — — — L R L -

round 3: L R R — — L R — L L — R

[-] drislands@lemmy.world 4 points 11 months ago* (last edited 11 months ago)

This would be easier to parse with a monospaced font. I'm not sure how that works in lemmy so this might take an edit or two...


round 1: L L L L R R R R — — — -

round 2: L L R R R — — — L R L -

round 3: L R R — — L R — L L — R```
[-] skydivekingair@lemmy.world 3 points 11 months ago

Cool, thanks. I’m not the best at formatting when using my phone.

[-] Mr_Dr_Oink@lemmy.world 2 points 11 months ago* (last edited 11 months ago)

Oh i get it. So if in round 1 it tilted down on the right. Round 2 it was even then round 3 it tilted down on the right then it was person G and they are heavier. However if it was reversed and tilted on the left then even then left then it was still person G but they are lighter. Because that pattern only occurs once. This is brilliant. Thankyou to you and the person you corrected the formatting of.

this post was submitted on 30 Nov 2023
2547 points (99.6% liked)

Programmer Humor

19454 readers
770 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