Talk:Binary search algorithm

message: I observe that if the search terminates in Step 2 as "unsuccessful", the target value 'T' would be located between AR and AL.  That is, R is the index (possibly -1) of the array element less than T and L is the index of the array element (possibly n) of the array element greater than T.
I find this property of the procedure useful when searching ranges.  It is, I believe, one step faster than using the right-most or left-most variants on average.
I'm not sure if a note on the Article page is justified, but having this information would be helpful to those doing "range" searches.  It may be that a note on the Article page violates some policy WRT cited work vs. original work, other Talk topics make me think it might.
This is not a comment on the utility of the left-most or right-most variants.  They are useful when the array can contain duplicates.  Usually no duplicates are present when the problem is to determine which range a value is in.
Glennp17321 (talk) 18:52, 17 May 2020 (UTC)
thread_title:  Primary Procedure can Yield Position in "unsuccessful" case 

message: First of all, someone needs to define which regex means "Approximate matches"
I believe that they are exclusively talking about "begins with..." / "starts with..."
but it has almost nothing to do with binary searching.
Even though it's interesting, it's not related to the Binary Search Algorithm.
AlwaysAngry (talk) 18:46, 25 November 2022 (UTC)
thread_title:  Approximate matches doesn't belong in this article 

message: Here are two instances of ancient texts that describe finding an item (person) in a list (group) by halving the size of the list in each iteration and examining a predicate over each. These instances may be earlier than the currently listed reference to sorted lists in a Babylonian tablet.
1. The Losaka story in the Jataka tales:  
So in time it came to pass that the people fell into a wretched plight. Reflecting that such had not been their lot in former days, but that now they were going to rack and ruin, they concluded that there must be some breeder of misfortune among them, and resolved to divide into two bands. This they did; and there were then two bands of five hundred families each. Thence-forward, ruin dogged the band which included the parents of the future Losaka, whilst the other five hundred families throve apace. So the former resolved to go on halving their numbers, and did so, until this one family was parted from all the rest.
src: https://www.sacred-texts.com/bud/j1/j1044.htm
2. 1 Samuel 14:41 in the Old Testament, as described in Urim and Thummim#Form_and_function.
src: https://en.wikisource.org/wiki/Bible_(King_James)/1_Samuel#14:41  
- 152.44.156.175 (talk) 07:56, 4 July 2023 (UTC)
thread_title:  Examples of binary search described in ancient texts 

message: Should we consider adding a section on galloping binary search, which operates differently, but it fundamentally the same algorithm? See for example Cormack's book on search systems. DMH43 (talk) 17:05, 29 December 2023 (UTC)
thread_title:  Section on galloping binary search? 

message: === :Binary search algorithm →  ===
The page was moved in 2005. I believe this extra word is not necessary. Here are what sources say:
* CLRS vol. 1, 3rd edition
** "binary search" 21 times (excluding 253 counts of "binary search tree")
** of which "binary search algorithm" appears 2 times (upon first mention)
* Programming Pearls
** "binary search" 32 times (excluding 5 counts of "binary search tree")
** no mention of "binary search algorithm"
* TAOCP vol. 3 (searching and sorting), 2nd edition
** "binary search" 62 times (excluding "binary search tree")
** of which "binary search algorithm" 4 times,
** and "binary search procedure" once.
IntGrah (talk) 20:42, 1 June 2024 (UTC)
thread_title:  Requested move 1 June 2024 

message: The page was moved in 2005. I believe this extra word is not necessary. Here are what sources say:
* CLRS vol. 1, 3rd edition
** "binary search" 21 times (excluding 253 counts of "binary search tree")
** of which "binary search algorithm" appears 2 times (upon first mention)
* Programming Pearls
** "binary search" 32 times (excluding 5 counts of "binary search tree")
** no mention of "binary search algorithm"
* TAOCP vol. 3 (searching and sorting), 2nd edition
** "binary search" 62 times (excluding "binary search tree")
** of which "binary search algorithm" 4 times,
** and "binary search procedure" once.
IntGrah (talk) 20:42, 1 June 2024 (UTC)
thread_title:  [[:Binary search algorithm]] → {{no redirect|Binary search}}