A small wrapper that implement the binary search algorithm in javascript, a lot faster than using a loop
Switch branches/tags
Nothing to show
Pull request Compare This branch is even with posabsolute:master.
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
array.js
index.html
readme.md
searchBinary.js
searchNormal.js

readme.md

Binary search algorithm

With this little helper you just pass your array and what you are looking for and it will return you back a result array, a typical use would look like this:

var searchResult = searchBinary("m", array, true)
the parameters are : searchBinary(search string, array to search, case insensitive?)

This will return an array with all items starting by the letter m. A good use of this script would be with a auto-complete widget.

For more informations: http://www.position-absolute.com/articles/optimizing-a-search-functionality-with-large-javascript-arrays/