An interactive binary search tree. The user may interact with the tree by performing rotations, balancing, insertions, and deletions. For educational purposes
aC++code which is written in "binary search tree" method,and works like dictionary(included each word and its meaning in a Node)this programe has to be able to add,update and pass the tree(in inorder way) which you definde.
CLAW is a C++ Library providing various tools in different domains, like a Tweener framework, BAÂ©zier curves manipulation, a map with multiple value types, a binary search tree container implemented as an AVL and an implementation of the...
Basic (plain text) search tool built in Java. Whole Word and Case Sensitive functions are implemented.
Delphi class incapsulating functionality of Red-black binary search tree
CLucene is a C++ port of Lucene: the high-performance, full-featured text search engine written in Java. CLucene is faster than lucene as it is written in C++.
The Java/RTR Project address the development of soft real-time code in Java, mainly using the RTR Model and the Java/RTR programming language. It uses the RTSJ specification as main API, and only works on plataforms that have support to it.
Visual class designer, and code in java generation.Program should provide ability to create and modified class, and after that generate in Java language on beginning.
Orange Visual Editor is a RAD Editor written in Java to generate code in Java, can be easily extended and can run inside any application lieke Eclipse or JEdit
Pruttel is an open-source full-text search-engine written in Java, which allows you to use wildcards in your queries and still aims to reach high performance.
A dynamic binary translation framework, written in Java, on top of the Jikes RVM, to enable the emulation and execution of legacy applications compiled for different architectures within the optimizing (dynamic/adaptive) and safe JVM.
This demonstrates a simple binary search through sorted data.
A binary search is a basic algorithm provided by bisect in Python.
The binary search can be summarized by two lines of code:
DSA extensions contains classes similar in purpose to the classes provided in java.util.
Currently, it contains sortable Lists and Maps, as well as a balanced binary search tree and a binary array search algorithm.
Binary search trees provide O(lg n) performance on average for important operations such as item insertion, deletion, and search operations. Balanced trees provide O(lg n) even in the worst case.
GNU libavl is the most complete,...
Tree Editor for Java is an Eclipse plug-in that allow user to view and modify Java source code as a tree. It was created on the basis of Abstract Syntax Tree (AST), however to make it more intuitive it is wrapped up.
This is an implementation of the binary search algorithm in (almost) one line. Given a number 'n' and a list 'L', the function returns the index of the number on the list, or -1.
Code Line Counter Pro - Java Version may be helpful for SQA, Java programmers, project managers and other customers who need an overview of a project source code.
This easy-to-use application will help you get detailed reports on the source...
Writing a binary search algorithm is surprisingly error-prone. The solution: trick the built-in bisect module into doing it for you.
The documentation for bisect says that it works on lists, but it really works on anything with a...
Search value 'v' in sorted vector 'x' and find index and value
with respect to vector x that is equal or closest to 'v'.
If more than one value is equal then anyone can be returned
(this is property of binary search).
an autoIt script to do binary search debugging. you'll need to install autoIt to use this script. the script is a framework to automate binary search debugging methodology.
this code is set up as an example of automated binary...