{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreiaoduxsvnw76ozn4kxvnf6drio5y2yzggyp6dlfuyadbeie5m2okq",
    "uri": "at://did:plc:i243uudlyj6njfil6ddywa7k/app.bsky.feed.post/3mkrrwduzn7d2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiftw3lmg3akaszq2p4jl3pzi6tjgllfm44km4cfnhlmgxjvr67twq"
    },
    "mimeType": "image/jpeg",
    "size": 182367
  },
  "path": "/2026/04/30/a-computer-scientist-beat-textbook-binary-search-by-more-than-2x.html",
  "publishedAt": "2026-04-30T22:57:17.000Z",
  "site": "https://boingboing.net",
  "tags": [
    "Post",
    "algorithms",
    "computer science",
    "Daniel Lemire",
    "programming",
    "SIMD",
    "Technology",
    "Read the rest",
    "A computer scientist beat textbook binary search by more than 2x",
    "Boing Boing"
  ],
  "textContent": "Binary search is the page-flipping trick everyone learns in their first programming class: to find a word in a sorted list, look at the middle, decide whether your target is in the top or bottom half, and repeat. It has been considered close to optimal since the 1940s. — Read the rest \n\nThe post A computer scientist beat textbook binary search by more than 2x appeared first on Boing Boing.",
  "title": "A computer scientist beat textbook binary search by more than 2x"
}