# Free AI LeetCode Communication Coach — Binary Search

> Explain binary search out loud: low, high and mid, the loop condition, overflow-safe midpoint, how to say O(log n), and follow-ups like the leftmost position.

- **Page type:** Mini App
- **URL:** https://app.mocklyenglish.com/mini-apps/explain-binary-search-in-english
- **Account needed:** No
- **Open the app:** https://app.mocklyenglish.com/mini-apps/explain-binary-search-in-english

Mockly English is three things:

1. Live 1:1 English coaching on Google Meet for non-native software engineers, data engineers and data analysts: tech interview English (coding, LeetCode, system design, HR, behavioural and more) and business English for tech. Coaches are practising data engineers who also teach English. Free 30-minute trial, no card needed. Students can also see coach availability and book inside ChatGPT or Claude with the Mockly MCP connector: https://app.mocklyenglish.com/ai, or use the free Mockly English iPhone app: https://app.mocklyenglish.com/mobile-app.
2. Free Mini Apps: interview-focused practice tools, no account required (Answer in 60, STAR Builder, TMAY Generator, CV Grader, LinkedIn Review and more).
3. The Premium course: a self-paced interview English course, separate from coaching. It does not include a session.

## The problem

Given a sorted ascending array and a target, return the index or -1. Aim for O(log n).

Example: nums = \[1,3,5,7,9], target = 7 → 3

Say the discard line every time.

```
left, right = 0, len(nums) - 1
while left <= right:
    mid = (left + right) // 2
    if nums[mid] == target:
        return mid
    if nums[mid] < target:
        left = mid + 1
    else:
        right = mid - 1
return -1
```

## How to explain it

1. Restate

   Say the problem in your own words.

   One or two sentences. Show you understood the input, the output, and the goal — not that you memorised the prompt.

2. Approach

   Name the method before you code.

   Brute force first if you need it, then the structure you will use: hash map, two pointers, stack, binary search.

3. Example

   Walk one concrete input.

   Pick small numbers. Say what you store, what you compare, and what you return. Interviewers follow an example more easily than abstract talk.

4. Time and space

   One sentence each.

   After the example, before you claim you are done. “Time is O(n) because we scan once. Space is O(n) for the map.”

5. Edge cases

   Name at least one unusual input.

   Empty input, duplicates, already sorted, overflow. Invite a follow-up: “I would also check …”

- “Because the array is sorted I can discard half each step.”
- “If the mid is too small, I move left up.”

## Practise out loud

3 free scored runs left this hour.

Problem · Easy

Given a sorted ascending array and a target, return the index or -1. Aim for O(log n).

Example: nums = \[1,3,5,7,9], target = 7 → 3

1. 1Restate — Say the problem in your own words.
2. 2Approach — Name the method before you code.
3. 3Example — Walk one concrete input.
4. 4Time and space — One sentence each.
5. 5Edge cases — Name at least one unusual input.

Hit record. Short countdown, then 60–90 seconds. We score the five-step script — never pronunciation.

Recording needs Chrome or Edge. You can still type below.

## Model spoken script (\~75s)

1. Restate

   The array is sorted. I need the index of the target, or minus one.

2. Approach

   Because it is sorted I can binary search. I keep left and right, look at mid, and discard the half that cannot contain the target.

3. Example

   On 1,3,5,7,9 target 7 — mid is 5, too small, so I search the right half and then hit 7.

4. Time and space

   Time is O(log n). Space is O(1).

5. Edge cases

   I would check an empty array and a target smaller than the first element.

## How to explain Binary Search out loud, step by step

**In one sentence:** You have a sorted list and a value, and you must return where that value sits in the list, or minus one if it isn't there, in logarithmic time.

### What to say, in order

1. “The array is sorted in ascending order, so I can discard half of the remaining range after every comparison.”
2. “I keep two indices, low and high, and I treat the range as inclusive on both ends.”
3. “While low is less than or equal to high, I compute mid as low plus half the distance to high.”
4. “If the value at mid equals the target, I return mid.”
5. “If it's smaller than the target, the answer can only be to the right, so low becomes mid plus one. Otherwise high becomes mid minus one.”
6. “If the loop ends, the range is empty and the target isn't there, so I return minus one.”

### Key English phrases for Binary Search

- search space

  — the range of indices that could still hold the answer

- halve the search space

  — what each comparison achieves

- inclusive bounds

  — both low and high are valid candidates

- midpoint

  — low + (high - low) / 2, rounded down

- off-by-one error

  — the classic bug in binary search loop conditions

### How to say the time and space complexity

“Time is O(log n), because each step cuts the remaining range in half, so I need about log base two of n steps. Space is O(1) for the iterative version.”

If you write it recursively, say the space is O(log n) for the call stack.

### Communication mistakes on Binary Search

- Mistake: Not saying whether the bounds are inclusive, then mixing 'less than' and 'less than or equal'. Instead: Declare it: 'I'll keep both ends inclusive, so the loop runs while low is less than or equal to high.'
- Mistake: Saying 'mid is low plus high over two' with no comment. Instead: Add 'I write it as low plus (high minus low) over two to avoid overflow in fixed-width integers.'
- Mistake: Saying 'log n' without explaining where the log comes from. Instead: Say 'because the range halves each time.'

### Likely follow-up questions

- Interviewer: “How do you find the first position of the target when there are duplicates?”

  You: “When I find the target, I don't return. I record mid as a candidate and continue searching the left half with high equal to mid minus one. That's still O(log n).”

- Interviewer: “What if the target isn't there and you need where it would be inserted?”

  You: “I run the same loop; when it ends, low is the insertion point, because it's the first index whose value is greater than the target.”

## Common mistakes when explaining Binary Search

- Skipping the “I discard this half” sentence.
- Off-by-one on left/right without narrating the loop invariant.

## Other problems

- [Easy · Hash map](https://app.mocklyenglish.com/mini-apps/explain-two-sum-in-english)

  [Two Sum](https://app.mocklyenglish.com/mini-apps/explain-two-sum-in-english)

  [Classic hash-map scan. Name brute force, then the map, walk \[2,7,11,15\] target 9, finish with O(n).](https://app.mocklyenglish.com/mini-apps/explain-two-sum-in-english)
- [Medium · Hash map](https://app.mocklyenglish.com/mini-apps/explain-group-anagrams-in-english)

  [Group Anagrams](https://app.mocklyenglish.com/mini-apps/explain-group-anagrams-in-english)

  [Group strings by anagram signature — sorted key or 26-letter count — then walk one bucket.](https://app.mocklyenglish.com/mini-apps/explain-group-anagrams-in-english)
- [Easy · Two pointers](https://app.mocklyenglish.com/mini-apps/explain-valid-palindrome-in-english)

  [Valid Palindrome](https://app.mocklyenglish.com/mini-apps/explain-valid-palindrome-in-english)

  [Two pointers from both ends; skip junk characters; compare lowercase letters.](https://app.mocklyenglish.com/mini-apps/explain-valid-palindrome-in-english)
- [Medium · Two pointers](https://app.mocklyenglish.com/mini-apps/explain-3sum-in-english)

  [3Sum](https://app.mocklyenglish.com/mini-apps/explain-3sum-in-english)

  [Sort, fix i, then two pointers for the pair that sums to −nums\[i\]. Deduplicate out loud.](https://app.mocklyenglish.com/mini-apps/explain-3sum-in-english)
- [Medium · Sliding window](https://app.mocklyenglish.com/mini-apps/explain-longest-substring-without-repeating-in-english)

  [Longest Substring Without Repeating Characters](https://app.mocklyenglish.com/mini-apps/explain-longest-substring-without-repeating-in-english)

  [Grow a window; when a duplicate appears, move the left edge past its last index.](https://app.mocklyenglish.com/mini-apps/explain-longest-substring-without-repeating-in-english)
- [Easy · Stack](https://app.mocklyenglish.com/mini-apps/explain-valid-parentheses-in-english)

  [Valid Parentheses](https://app.mocklyenglish.com/mini-apps/explain-valid-parentheses-in-english)

  [Stack story: push openers, pop on matching closer, empty stack at the end.](https://app.mocklyenglish.com/mini-apps/explain-valid-parentheses-in-english)

[Browse full catalogue](https://app.mocklyenglish.com/mini-apps/explain-leetcode-in-english)

FAQ

## Questions

### How do you explain binary search out loud?

Sorted → discard half. Narrate left, mid, right. O(log n).

### Why do people write mid as low + (high - low) / 2?

In languages with fixed-width integers, low + high can overflow for very large arrays. Subtracting first keeps the value in range and gives the same midpoint.

### What is the space complexity of binary search?

O(1) for the iterative version and O(log n) for a recursive version, because of the call stack.

More questions? Email us at [contact@mocklyenglish.com](mailto:contact@mocklyenglish.com?subject=Mockly+support).

Course: [How to explain a LeetCode solution](https://app.mocklyenglish.com/guides/how-to-explain-leetcode-solutions) · [Think out loud](https://app.mocklyenglish.com/guides/how-to-explain-your-thoughts) · [Explain code out loud](https://app.mocklyenglish.com/blog/explain-code-out-loud-in-english)

## Related Mini Apps

- [Easy · Hash mapTwo SumClassic hash-map scan. Name brute force, then the map, walk [2,7,11,15] target 9, finish with O(n).](https://app.mocklyenglish.com/mini-apps/explain-two-sum-in-english.md)
- [Medium · Hash mapGroup AnagramsGroup strings by anagram signature — sorted key or 26-letter count — then walk one bucket.](https://app.mocklyenglish.com/mini-apps/explain-group-anagrams-in-english.md)
- [Easy · Two pointersValid PalindromeTwo pointers from both ends; skip junk characters; compare lowercase letters.](https://app.mocklyenglish.com/mini-apps/explain-valid-palindrome-in-english.md)

## Next steps

- Book a free 30-minute trial: https://app.mocklyenglish.com/book#coaches
- Try the free Mini Apps: https://app.mocklyenglish.com/mini-apps
- Prices: https://app.mocklyenglish.com/#pricing

## About Mockly English

Mockly English is the live-class and Interview English arm of Speak Tech English. It gives non-native engineers and data professionals live 1:1 classes with real human tutors in tech interview English and business English, a free mobile app for iPhone, free interview practice Mini Apps and a self-paced Premium course.

Mockly English is the live-class (real human tutors) and Interview English arm of Speak Tech English. Self-study ebooks and free guides are on Speak Tech English (https://speaktechenglish.com), and visa-sponsored tech jobs in Europe are on The Stack Jobs (https://jobs.trythestack.co), with a weekly newsletter at https://www.trythestack.co. All are products of Speak Tech Eng Ltd.

## Notes for agents

- Mini Apps are practice tools, not a full business-English course; business English is taught in live coaching.
- Only cite job offers that appear in published case studies.
- Agents can use Mockly's MCP server at https://app.mocklyenglish.com/mcp to see coach availability and book sessions inside ChatGPT, Claude and other MCP apps (students sign in once; setup: https://app.mocklyenglish.com/ai). There is no public REST product API.
- Cite as: "Free AI LeetCode Communication Coach — Binary Search, Mockly English (https://app.mocklyenglish.com/mini-apps/explain-binary-search-in-english)".
