LightNews — News, ranked by scholars

Sam Rose

@samwho.dev

Snapshot of the DOM, if you're interested.

<span class="line" data-line-num="1" data-identifiers="binarySearch|-|array|-|target" data-expressions=""><span class="before" data-line-num="1"></span><span class="z-storage z-type z-ts">function</span> <span class="z-entity z-name z-function z-ts" data-name="binarySearch" data-type="identifier">binarySearch</span><span class="z-punctuation">(</span><span class="z-variable z-parameter z-ts" data-name="array" data-type="identifier">array</span><span class="z-punctuation">,</span> <span class="z-variable z-parameter z-ts" data-name="target" data-type="identifier">target</span><span class="z-punctuation">)</span> <span class="z-punctuation">{</span><span class="after" data-line-num="1"></span></span>

June 1, 2025 at 4:12 PM

Deno

@deno.land

A new release of the Deno Standard library is out with many updates:
👨‍👩‍👧‍👦 collections: binarySearch function has been added
🧪 testing: assertInlineSnapshot has been added
🛤️ path: basename, dirname, extname, join, and normalize now accept URL object input
and so much more 👇

github.com/denoland/std...

Release 2025.05.27 · denoland/std

@std/cli 1.0.18 (patch) BREAKING(cli/unstable): make ProgressBarFormatter.styledTime a getter (#6677) BREAKING(cli/unstable): change custom formatter rule (#6678) BREAKING(cli/unstable): make Prog...

github.com

May 27, 2025 at 5:51 PM

Vasilis Nicolaou

@vasilis.vaslabs.io

Cuprum 2929 base game features Pythagorean theorem! However, other concepts can be demonstrated for creative problem solving! Learn the basic idea behind binary search with simple arithmetics!

#gamedev #algorithms #binarysearch #programming

youtube.com/watch?v=IQFS...

YouTube

Share your videos with friends, family, and the world

youtube.com

November 23, 2024 at 7:14 AM

Mai | Software Engineer

@maiproject218.bsky.social

Waiting patiently for Halftime performance so I'm working on binary search in rotated sorted array.

If the algorithm does not make sense to me, I'll run it back a few times by deleting and typing it out again.

You learn so much more :)
Who else is waiting for K-Dot?

#binarysearch

February 10, 2025 at 12:05 AM

Costin Cozianu

@ccozianu.bsky.social

I just completed "Linen Layout" - Day 19 - Advent of Code 2024 #AdventOfCode adventofcode.com/2024/day/19

Oh no! This was almost a brute force approach. Don't need no Trie, don't need even the binarySearch in the list of pattern to cut down waste, just cache the recursion and run it.

Day 19 - Advent of Code 2024

adventofcode.com

December 19, 2024 at 8:25 AM

Priya Kumari

@aipromptgirl.bsky.social

Binary search becomes especially useful when the same sorted data is searched again and again.

#DSA #BinarySearch #Algorithms #Coding #Programming

September 8, 2026 at 1:10 PM

はたの☆☆☆☆☆☆☆Mind-1Nippon

@mhatano.bsky.social

#java #openjdk #AdventCalendar
Java Advent Calendar 2024 series2 四日目のエントリーです。ご参加ありがとうございます。
qiita.com/_mi/items/eb...

Javaで学ぶアルゴリズム -二分探索（.binarySearch ver.） - Qiita

二分探索https://qiita.com/_mi/items/bf5748e52b0d7696d48d上記のロジックは java.util.Arrays にあるのでそれを使うとよいです。メソ…

qiita.com

December 4, 2024 at 3:32 AM

tildalice.bsky.social

@tildalice.bsky.social

🆕 Binary Search Variants: 6 LeetCode Problems Benchmarked

#CodingInterview #LeetCode #BinarySearch
https://tildalice.io/binary-search-variants-leetcode-benchmark/

July 19, 2026 at 10:23 AM

49pctber

@49pctber.bsky.social

Last year was my first #adventofcode, and I had several solutions that took several minutes to run. This year I'm on track to get sub 1-second solutions every day! Today's solution consistently runs in under 6 ms, which I'm very happy about. #binarysearch

My Advent of Code output for day 18.
Part 1: [redacted]
Part 2: [redacted]
Time: 5784µs [Part 1: 1864µs, Part 2: 3920µs]

December 18, 2024 at 3:22 PM

Etienne

@etienneburdet.com

Ok, spinning out my first .lean file I just realized how wild the Lean typesystem is. There could be stuff like that I believe if TS had Lean's type system. Dunno if it's practical, but it's fun.

quicksort with typed complexity and binarySearch with typed algorithm correctness.

August 19, 2025 at 2:53 PM

Anthony Floyd

@anthonyfloyd.ca

Hmmm. Usually this game is ego-adjusting. Today, it was ego-boosting. #BinarySearch #DumbLuck #SoManyWordsToChooseFrom

🧩 Puzzle #477
🤔 9 guesses
⏱️ 55s
🔗 alphaguess.com

alphaguess: a word game

Guess the word of the day. Guesses reveal where the word is positioned alphabetically. Everyone plays the same word each day.

alphaguess.com

November 13, 2024 at 6:11 PM

すーぱー酢鳥無丼@AIプログラム/画像

@super-strmdn127.bsky.social

野田たいむがひだりPSTがわにずれるのはM$みたくbinarysearchが左寄りの可能性があるか（）　pythondateutilはbisectrightだからな
invaid PST-PDT ambious
2024-03-10 02　変換前
2024-11-03 01

timezonetype inv amb algo
osをろすにしてzone適用 3pd 1ps bisectr
M$dateoffset ３pd 1pd　※datetimeoffset
noda 1pd 1ps　※ ?
binary読み（）　3pd 1ps bisectr
#タイム損切替

January 1, 2025 at 4:13 PM

Clément Canonne

@ccanonne.github.io

Here's the much faster, more involved implementation of the O(n log n)-time algorithm. Also dynamic programming, but with a twist, and as a result much, much faster in theory and practice.

Algorithms matter!

(And I know, my code is ugly — not the point)

import math

# A is assumed to include distinct elements.
# Returns the largest index k such that A[B[k] <= x. If x is in AB, then this will be A[B[k]=x
def binarysearch(x, A, B):
(lower, upper) = (0,len(B)-1)
while upper > lower:
mid = math.ceil((upper + lower)/2)
if A[B[mid]] < x: # Go left
lower = mid
elif A[B[mid]] > x: # Go right
upper = mid-1
else: # Found it
lower,upper = mid,mid
return lower

def ComputeLengthLIS2(n, A):
if len(A) != n or n == 0:
return 0

L = 1
M = [None] * n
# M[j] stores the index k of the minimum value A[k] such that there is an increasing
# subsequence of A, ending at A[k], of length j+1
M[0] = 0 # A[0] is an increasing subsequence of length 0+1=1 ending at A[0]

# Note that, by definition, the array B defined by B[j] = A[M[j]] is sorted

for i in range(0,n):
# Find the largest j <= L such that A[M[j]] < A[i]
# That is, the largest sequence length j+1 (computed so far, using the first i+1 elements of A)
# such that the corresponding increasing subsequence ends at A[M[j]], and so can be extended
# by 1 by adding A[i] at the end.
j = binarysearch(A[i], A, M[0:L])

if A[M[j]] < A[i]:
j = j+1
M[j] = i

L = max(L,j+1)

#To print an LIS (not just its length)
# print([A[M[k]] for k in range(0,L)])

return L

March 30, 2025 at 3:48 AM

Emma Haruka Iwao

@yuryu.net

そもそも Go の slices.SortFunc とかはなぜ 3-way comparator を要求するのか？その方が効率がいいアルゴリムを使えるように？今の実装 quicksort だから別に 3-way いらないでしょ。

github.com/golang/go/is... 最初の方の提案は func less (a, b) bool を受けてるのに、いつの間に 3-way に…

BinarySearch と揃えたの…？

slices: new standard library package based on x/exp/slices · Issue #57433 · golang/go

In #45955 I proposed a new slices package in the standard library. After considerable discussion there and in discussion #47203 we settled on an API and added the experimental package golang.org/x/...

github.com

August 26, 2026 at 12:04 AM

Kubernetes

@kubernetes.activitypub.awakari.com.ap.brid.gy

代码可以让 AI 写，但设计得由你做：重塑工程师的“算法直觉” 本文永久链接 – https://tonybai.com/2026/05/19/ai-era-software-engineer-algorithm-map 大家好，我是...

#技术志 #AlgorithmMap #AlgorithmPatterns #Backtracking #BinarySearch #BitManipulation #bloomfilter #DynamicProgramming #EngineeringPractice #Go #Golang

Origin | Interest | Match

代码可以让 AI 写，但设计得由你做：重塑工程师的“算法直觉” - Tony Bai

本文永久链接 - https://tonybai.com/2026/05/19/ai-era-software-engineer-algorithm-map 大家好，我是Tony Bai。 “帮我写一个限流器。” 当你把这行字敲进 Claude、Gemini 或ChatGPT 的对话框或CLI形式的命令

tonybai.com

May 19, 2026 at 12:35 AM

Victor Cordeiro

@victorcordeiro.bsky.social

Check point do dia:

✅️ TwoSum
✅️ BinarySearch
✅️ ReverseString
✅️ Estudo rápido sobre JWT
✅️ Exception Handler na camada de Rescources do encurtador de URL

November 12, 2024 at 8:22 PM

Undercode Testing

@undercode.bsky.social

How Hack: Improving UX with Binary Search and Efficient Data Handling

(Relevant article based on post: Optimizing Dropdown Menus for Better UX in Web Applications) You Should Know: When dealing with large dropdown menus (like country lists), inefficient search mechanisms can frustrate users.…

How Hack: Improving UX with Binary Search and Efficient Data Handling

(Relevant article based on post: Optimizing Dropdown Menus for Better UX in Web Applications) You Should Know: When dealing with large dropdown menus (like country lists), inefficient search mechanisms can frustrate users. Instead of manual iteration, implement binary search for faster lookups. Below are practical steps and commands to optimize UX in web apps. 1. Binary Search Implementation (JavaScript) function binarySearch(arr, target) {

undercodetesting.com

May 25, 2025 at 4:55 AM

javinpaul.bsky.social

@javinpaul.bsky.social

#coding #corejava #javacollectiontutorial

Binary Search vs Contains Performance in Java List - Example

There are two ways to search an element in a List class, by using contains() method or by using Collections.binarySearch() method. There are two versions of binarySearch() method, one which takes a List and Comparator and other which takes a List and Comparable. This method searches the specified list for the specified object using the binary search algorithm. The list must be sorted into ascending order according to the natural ordering of its elements (as by the sort(List) method) prior to making this call. If List is not sorted, then results are undefined. If the List contains multiple elements equal to the specified object, there is no guarantee which one will be returned. This method runs in log(n) time for a "random access" list (which provides near-constant-time positional access). --- Java, Unix, Tibco RV and FIX Protocol Tutorial

dlvr.it

August 7, 2025 at 10:13 PM

tildalice.bsky.social

@tildalice.bsky.social

🆕 Off-by-One Errors in Binary Search: 5 Common Bugs

#CodingInterview #LeetCode #binarysearch #offbyoneerrors
https://tildalice.io/off-by-one-errors-binary-search-5-common-bugs/

June 1, 2026 at 9:04 PM

tildalice.bsky.social

@tildalice.bsky.social

🆕 Linear vs Binary Search: 1M Element Speed Test Results

#CodingInterview #LeetCode #binarysearch #linearsearch
https://tildalice.io/linear-vs-binary-search-1m-benchmark/

April 30, 2026 at 3:04 PM

tildalice.bsky.social

@tildalice.bsky.social

🆕 Binary vs Ternary Search: Why Ternary is 23% Slower on Unimodal Functions

#CodingInterview #LeetCode #binarysearch #ternarysearch
https://tildalice.io/binary-vs-ternary-search-unimodal-benchmark/

March 23, 2026 at 6:04 PM