https://github.com/ediloaz/bst-dynamic-vs-bst-greedy
Finds the BST optimal using a dynamic and a greedy algorithm. Analyze both trees and processing time of the solution (on Latex document).
https://github.com/ediloaz/bst-dynamic-vs-bst-greedy
binary-search-tree bstree c comparative-analysis dynamic-programming greedy-algorithms linux operations-research
Last synced: about 1 month ago
JSON representation
Finds the BST optimal using a dynamic and a greedy algorithm. Analyze both trees and processing time of the solution (on Latex document).
- Host: GitHub
- URL: https://github.com/ediloaz/bst-dynamic-vs-bst-greedy
- Owner: ediloaz
- Created: 2018-08-05T19:08:07.000Z (almost 8 years ago)
- Default Branch: master
- Last Pushed: 2018-08-06T03:27:29.000Z (almost 8 years ago)
- Last Synced: 2025-06-21T18:09:57.379Z (12 months ago)
- Topics: binary-search-tree, bstree, c, comparative-analysis, dynamic-programming, greedy-algorithms, linux, operations-research
- Language: C
- Homepage:
- Size: 985 KB
- Stars: 0
- Watchers: 0
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# BST Dynamic vs BST Greedy
This program was created as part of an evaluation of a bachelor course in engineering. Resolves and find the optimal BST (Binary Search Tree) using two algorithms:
* Dynamic Algorithm ([about this](https://en.wikipedia.org/wiki/Dynamic_algorithm))
* Greedy Algorithm ([about this](https://en.wikipedia.org/wiki/Greedy_algorithm))
Both were programmed in C on Linux, the main purpose was not to find the tree, but to make a comparison between these two algorithms taking the time and the "correct solution" factors.
## Input
Is on the Linux terminal, not has a interface, the user can use two different ways:
* Example mode
* Experiment mode
### Example mode
Generate and solve a single random case with the two algorithms. The execution of the program generates a latex document where it specifies the initial problem, the response with the greedy algorithm, the response with the dynamic programming algorithm (both with their respective tables) and the conclusions reached in that execution.
The input must will be:
```
./program -X
```
### Experiment mode
Generates and solves N random cases, collects statistical data. The execution of the program generates a latex document where it specifies the amount of data that will be used, the time tables of both algorithms, as well as an additional one which shows the percentage of optimal responses produced by the Greedy algorithm.
The input must will be:
```
./program -E=N
```
Where the "N" parameter is the number of **N\*10 random cases** that you want.
## Output
A .tex file (and others files required) will create and convert to pdf with *pdflatex command* and will open with *evince command*. All these files are saved in **output** folder. And each mode create a different document structure.
### Example mode
### Experiment mode
## Prerequisites
It is necessary to have installed *latex* (including *pdflatex*), *pkg-config* and *evince* in your linux. You can install it with the following commands:
```
sudo apt-get install texlive-full
```
```
sudo apt-get install texmaker
```
```
sudo apt-get install evince
```
```
sudo apt install pkg-config
```
## Running
First is necessary compile the main file (*main.c*) with the command
```
gcc -o program main.c
```
and then it can be opened
```
./program
```
## Built With
* [Sublime text](https://www.sublimetext.com/3)
## Authors
* **Edisson López** - *Main developer* - [ediloaz](https://github.com/ediloaz)
See also the list of [repositories](https://github.com/ediloaz?tab=repositories) who I participated/created.