Icontem

JavaScript Binary Search Tree: Search values in an array using binary search

Recommend this page to a friend!
  Info   View files Example   View files View files (3)   DownloadInstall with Composer Download .zip   Reputation   Support forum   Blog    
Last Updated Ratings Unique User Downloads Download Rankings
2016-07-13 (3 years ago) RSS 2.0 feedNot enough user ratingsTotal: 77 All time: 455 This week: 6Up
Version License JavaScript version Categories
simple-binary-tree 1.0Custom (specified...5Data types, Utilities and Tools, Algo...
Description Author

This object can search values in an array using binary search.

It can initialize a sorted array using binary search to insert each of the array elements.

The object can also insert new values in the array and search the array to determine if a given value is already present.

Innovation Award
JavaScript Programming Innovation award nominee
August 2016
Number 4
Binary search is an efficient algorithm that is used to search for the position of a element that may be present in a sorted array or not.

It is used to minimized the number of checks necessary to determine if has array a given value and its position if present.

This object uses the binary search algorithm to search for values or insert new values in an array so its values always remain sorted.

Manuel Lemos
  Performance   Level  
Name: gustavo oliveira de ... <contact>
Classes: 2 packages by
Country: Brazil Brazil
Age: 23
All time rank: 14614 in Brazil Brazil
Week rank: 59 Up4 in Brazil Brazil Up
Innovation award
Innovation award
Nominee: 2x

Winner: 1x

  Files folder image Files  
File Role Description
Accessible without login Plain text file index.html Example example of usage
Accessible without login Plain text file license.txt Lic. MIT-zero license
Plain text file SBT.js Class the class itself

 Version Control Unique User Downloads Download Rankings  
 0%
Total:77
This week:0
All time:455
This week:6Up