Tag

#binary-search-algorithm

243 posts10 followers

Explore Hashnode

Alternatives

swayanprabha2d ago · 7 min read

Stop Thinking Binary Search Is Only for Searching 🔍

It’s not an algorithm to memorize. Most of us learn binary search like this: “Sorted array. Find the target. Done.” But the real skill is spotting when it fits, even when the problem has no sorted arr

dsadiscuss.hashnode.dev

0xmu04d ago · 28 min read

Binary Search: From Finding a Number to Finding a Boundary

The Reasoning Log — a journey through assumptions, failed intuitions, proofs, and a more general way of searching I do not particularly enjoy learning an algorithm by memorizing its final implementati

reasoninglog.hashnode.dev

Zenub NaqviSep 13 · 7 min read

The Line of Code That Broke Java's Standard Library for Nine Years

Here's a question first: if I gave you a sorted list of 8 billion numbers—roughly the population of Earth—and asked you to find one specific number, how many comparisons would you need in the worst ca

zenubnaqvi.hashnode.dev

AnnetJul 22 · 7 min read

Mastering Searching Algorithms in Python: From Linear Search to Binary Search 🔍

After learning Arrays, the next topic I explored was Searching Algorithms. At first, searching seemed straightforward. But as I started learning Binary Search, I discovered that it's much more than ju

html-portfolio.hashnode.dev

Bikash MainaliJul 6 · 6 min read

How the Call Stack Works (and How Recursion Uses It)

Let's build this up from the very beginning, one idea at a time. Part 1: What is a "stack" (the data structure)? Before touching code, picture a stack of plates: You can only add a plate to the top

dsa-3956.hashnode.dev

YashrajJun 2 · 13 min read

Master Binary Search: Templates, Rotated Arrays, Median of Two Sorted Arrays, and Binary Search on Answer

Binary search is one of the most elegant and efficient algorithms, yet it hides many traps. Off-by-one errors, infinite loops, and confusing mid calculations trip up even experienced developers. Once

yashrajxdev.blog

Shubham Kumar SinghApr 28 · 4 min read

Aggressive Cows Problem using Binary Search

Problem Core Idea You are not directly placing cows. Instead, you are guessing the answer (minimum distance) and checking: “Is it possible to place all cows with at least this distance?” Goal Find

blog.realdev.club

Shubham Kumar SinghApr 13 · 3 min read

Binary Seach

Imagine you’re searching for a word in a dictionary.You don’t start from page 1, right?You open somewhere in the middle. If your word comes before → go left If it comes after → go right This is ex

blog.realdev.club

Leonie ChristinaApr 13 · 6 min read

Using Bitmasks for Category Indexing Inside a Reference ID

If you've ever had to design a reference ID system, the kind where the format is fixed, the length is strict, and every character counts, you've probably run into this problem: "I need to store multip

devtofree.hashnode.dev

Avinash NegiFeb 18 · 6 min read

I Finally Understood BST — And It's Just Divide & Conquer in Disguise

Last article, I said trees made me nervous. Recursion. Nodes. Children. Height. I expected to be stuck for a week like linked lists. I wasn't. Binary Search Tree clicked faster than I expected — and o

dsawithpython.hashnode.dev

Search Hashnode

Explore Hashnode

Trending tags this week

Stop Thinking Binary Search Is Only for Searching 🔍

Binary Search: From Finding a Number to Finding a Boundary

The Line of Code That Broke Java's Standard Library for Nine Years

Mastering Searching Algorithms in Python: From Linear Search to Binary Search 🔍

How the Call Stack Works (and How Recursion Uses It)

Master Binary Search: Templates, Rotated Arrays, Median of Two Sorted Arrays, and Binary Search on Answer

Aggressive Cows Problem using Binary Search

Binary Seach

Using Bitmasks for Category Indexing Inside a Reference ID

I Finally Understood BST — And It's Just Divide & Conquer in Disguise