---
title: "Discussion on \"Binary Search in Clojure\" | Hashnode"
description: "Discussion on \"Binary Search in Clojure\". I decided to implement linear search before going after binary search. Now, I’m ready!\nWith linear search, we required the elements be sorted. We didn’t require the elements be bounded. In binary search, the inputs must be bounded because we maintain..."
url: "https://hashnode.com/posts/binary-search-in-clojure/69096d3f11aad9517d408574"
---

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

Discussion

# [Binary Search in Clojure](https://brettrowberry.com/binary-search-in-clojure?utm_source=hashnode&utm_medium=feed)

I decided to implement linear search before going after binary search. Now, I’m ready! With linear search, we required the elements be sorted. We didn’t require the elements be bounded. In binary search, the inputs must be bounded because we maintain...

Nov 4, 2025 · 2 min read · brettrowberry.com  
Updated Nov 30, 2025  
Read the article

-   [#clojure](https://hashnode.com/tag/clojure)
-   [#binary-search-algorithm](https://hashnode.com/tag/binary-search-algorithm)
-   [#search](https://hashnode.com/tag/search)
-   [#division-operator](https://hashnode.com/tag/division-operator)
-   [#integer](https://hashnode.com/tag/integer)

## Written by

[Brett Rowberry](https://hashnode.com/@brettrowberry)

@brettrowberry

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

Husband, dad, manager, functional programmer, and DIYer

I like programming (at work) and learning for fun. You'll often find me cooking and working on my house in my spare time.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
