{"id":151,"date":"2023-06-11T20:14:11","date_gmt":"2023-06-11T20:14:11","guid":{"rendered":"https:\/\/learnlearn.uk\/edexcel-igcse-computer-science\/?page_id=151"},"modified":"2023-11-04T13:42:49","modified_gmt":"2023-11-04T13:42:49","slug":"binary-search","status":"publish","type":"page","link":"https:\/\/learnlearn.uk\/edexcel-igcse-computer-science\/binary-search\/","title":{"rendered":"Binary Search"},"content":{"rendered":"
\n

Binary Search<\/h2>\n
\n\n

What is Binary Search?<\/h3>\n

Binary search is an efficient algorithm used to find a specific element in a sorted array or list. It works by repeatedly dividing the search space in half until the target element is found or determined to be absent.<\/p>\n

How does Binary Search work?<\/h3>\n
    \n
  1. Binary search starts by comparing the target element with the middle element of the array.\n
      \n
    • If they are equal, the search is complete.<\/li>\n
    • If the target element is smaller, the search continues on the lower half of the array;<\/li>\n
    • otherwise, it continues on the upper half.<\/li>\n<\/ul>\n<\/li>\n
    • This process is repeated until the target element is found or the search space is empty.<\/li>\n<\/ol>\n\n<\/div>

      Demonstration<\/h2>\n
      \n\n

      Binary Search Demonstration<\/h3>\n

      Have a go with the binary search demonstration below.<\/p>\n