---
title: "Discussion on \"Binary Search\" | Hashnode"
description: "Discussion on \"Binary Search\". Works for a sorted sequence of anything.\nIdea is to reduce the search space repeatedly until we reach to the final element or search space becomes exhausted.\n// Iterative Approach\nint left = 0 ,right = n -1;\nwhile(left<=right)\nint mid = (left + right..."
url: "https://hashnode.com/posts/binary-search/668c0b76ba95ef1db55f95a1"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Binary Search](https://curiousindian958.hashnode.dev/binary-search?utm_source=hashnode&utm_medium=feed)

Works for a sorted sequence of anything. Idea is to reduce the search space repeatedly until we reach to the final element or search space becomes exhausted. // Iterative Approach int left = 0 ,right = n -1; while(left<=right) int mid = (left + right...

Jul 8, 2024 · 1 min read · curiousindian958.hashnode.dev  
Read the article

## Written by

[Om Pawaskar](https://hashnode.com/@pawaskarom)

@pawaskarom

  
[View profile](https://hashnode.com/@pawaskarom)

Software Developer

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
