"binary search" meaning in English

{
  "forms": [
    {
      "form": "binary searches",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "binary search (countable and uncountable, plural binary searches)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A search for a value within a sorted array by repeatedly comparing the target value with the middle element; if they are unequal, the half in which the target cannot lie is eliminated and the comparison is repeated on the remaining half."
      ],
      "id": "en-binary_search-en-noun-VYL59ccR",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "value",
          "value"
        ],
        [
          "sort",
          "sort"
        ],
        [
          "array",
          "array"
        ],
        [
          "middle",
          "middle"
        ],
        [
          "element",
          "element"
        ],
        [
          "unequal",
          "unequal"
        ],
        [
          "eliminate",
          "eliminate"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A search for a value within a sorted array by repeatedly comparing the target value with the middle element; if they are unequal, the half in which the target cannot lie is eliminated and the comparison is repeated on the remaining half."
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "translations": [
        {
          "code": "eo",
          "lang": "Esperanto",
          "sense": "search for a value",
          "word": "duoniga serĉo"
        }
      ],
      "wikipedia": [
        "Binary search algorithm"
      ]
    }
  ],
  "word": "binary search"
}

{
  "forms": [
    {
      "form": "binary searches",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "binary search (countable and uncountable, plural binary searches)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English uncountable nouns",
        "en:Theory of computing"
      ],
      "glosses": [
        "A search for a value within a sorted array by repeatedly comparing the target value with the middle element; if they are unequal, the half in which the target cannot lie is eliminated and the comparison is repeated on the remaining half."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "value",
          "value"
        ],
        [
          "sort",
          "sort"
        ],
        [
          "array",
          "array"
        ],
        [
          "middle",
          "middle"
        ],
        [
          "element",
          "element"
        ],
        [
          "unequal",
          "unequal"
        ],
        [
          "eliminate",
          "eliminate"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A search for a value within a sorted array by repeatedly comparing the target value with the middle element; if they are unequal, the half in which the target cannot lie is eliminated and the comparison is repeated on the remaining half."
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Binary search algorithm"
      ]
    }
  ],
  "translations": [
    {
      "code": "eo",
      "lang": "Esperanto",
      "sense": "search for a value",
      "word": "duoniga serĉo"
    }
  ],
  "word": "binary search"
}