albert-espin / btree-word-finder

Balanced Binary Tree Word Finder

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

Balanced Binary Tree Word Finder

Program that reads a file and can answer queries of whether certain words appear in it. The number of times each word appears in the text can be seen too, among other information. Run "BTreeWordFinder.py" for the binary tree approach or "BalancedBTreeWordFinder.py" for the balanced binary tree model. The usage of tree-based data structures intends to speed up the organized storage and checking of words.

Programming language Python 2
Code language English (variables and functions), Catalan (comments and interface)
Report language Catalan
Authors Albert Espín and Pau Sanchez
Date May 2015
Code license MIT
Report license Creative Commons Attribution, Non-Commercial, Non-Derivative
Text files license Not owned by the authors of this work, original sources are not known but may be these: large_text.txt, small_text.txt, dictionary.txt

About

Balanced Binary Tree Word Finder

License:MIT License


Languages

Language:Python 100.0%