Comment on Binary search

• Cracks_InTheWalls@sh.itjust.works ⁨5⁩ ⁨weeks⁩ ago

  There’s lots of stuff about what I do that doesn’t make much sense :)

  It works in this scenario because the stacks are reliably sorted by date, and each form has a running tally of what cookies are on offer as things get added to the list.

  Assume a given customer’s forms are taken out, and you make two stacks of them without shuffling the forms. The very first form on the first stack from 2022-01-01 does not include cookie x. The first form on the second stack, from 2023-02-01, also does not contain cookie x. Based on this information and the conditions above, you can infer that the form you want is in the second stack.

  Now, if the forms were not reliably sorted, or did not contain a running record, you’d need to approach this differently. Strategies would probably involve inferences or straight getting the info you need from other sources - custumer correspondence around “We want cookie x, how much?” (if it occurred when you were in a position to get such correspondence); knowledge of big changes to cookie offerings to the client (contract renewals); bugging accounting at a regular, annoying cadence with progressive escalation until they answer/complain about you bugging them, etc.

  source

  • Lifter@discuss.tchncs.de ⁨5⁩ ⁨weeks⁩ ago

    Wow that got complicated very quickly. Bummer no-one can come up with a simple example of when quicksort is useful.

    source