<commit_before>##<NAME>, <NAME>
####EAFIT University, 2011-2

*'And all that I can see, is just a yellow lemon-tree'*  
-Fools Garden, Lemon Tree

##Data Structures & Algorithms I Final Project
The Final Project for this course was to implement a B-Tree together with a GUI in **Java**. It has manual input to search for a value, enter it or delete it, to load numbers from a text file, numbers in sequence from 0 to n, or n random numbers. It takes a while to load because it downloads the background image from the internet. This was made for educational purposes and is licensed under the **MIT License**.

###Input the B-Tree order
![](https://raw.githubusercontent.com/Zubieta/Data_Structures_And_Algorithms_I/master/Screenshots/DS1_Order.png)

###Graphical User Interface
![](https://raw.githubusercontent.com/Zubieta/Data_Structures_And_Algorithms_I/master/Screenshots/DS1_GUI.png)

###Basic Options
![](https://raw.githubusercontent.com/Zubieta/Data_Structures_And_Algorithms_I/master/Screenshots/DS1_Options.png)

**Prueba**: Select kind of test
![](https://raw.githubusercontent.com/Zubieta/Data_Structures_And_Algorithms_I/master/Screenshots/DS1_Test.png)
**Cargar Caso**: Test by loading numbers from a text file

**Numeros en Secuencia**: test by inserting first n numbers, from 1 to n
![](https://raw.githubusercontent.com/Zubieta/Data_Structures_And_Algorithms_I/master/Screenshots/DS1_Sequence.png)

**Numeros Aleatorios**: test by inserting insert n random numbers 
![](https://raw.githubusercontent.com/Zubieta/Data_Structures_And_Algorithms_I/master/Screenshots/DS1_Random.png)

**Insertar** : Insert a given number

**Buscar** : Search for a given number
![](https://raw.githubusercontent.com/Zubieta/Data_Structures_And_Algorithms_I/master/Screenshots/DS1_Search.png)

**Eliminar** : Delete a given number
![](https://raw.githubusercontent.com/Zubieta/Data_Structures_And_Algorithms_I/master/Screenshots/DS1_Delete.png)<commit_msg>Changes to README because Github changed uploaded image URL<commit_after>##<NAME>, <NAME>
####EAFIT University, 2011-2

*'And all that I can see, is just a yellow lemon-tree'*  
-Fools Garden, Lemon Tree

##Data Structures & Algorithms I Final Project
The Final Project for this course was to implement a B-Tree together with a GUI in **Java**. It has manual input to search for a value, enter it or delete it, to load numbers from a text file, numbers in sequence from 0 to n, or n random numbers. It takes a while to load because it downloads the background image from the internet. This was made for educational purposes and is licensed under the **MIT License**.

###Input the B-Tree order
![](https://github.com/Zubieta/Data_Structures_And_Algorithms_I/blob/master/Screenshots/DS1_Order.png?raw=true)

###Graphical User Interface
![](https://github.com/Zubieta/Data_Structures_And_Algorithms_I/blob/master/Screenshots/DS1_GUI.png?raw=true)

###Basic Options
![](https://github.com/Zubieta/Data_Structures_And_Algorithms_I/blob/master/Screenshots/DS1_Options.png?raw=true)

**Prueba**: Select kind of test
![](https://github.com/Zubieta/Data_Structures_And_Algorithms_I/blob/master/Screenshots/DS1_Test.png?raw=true)
**Cargar Caso**: Test by loading numbers from a text file

**Numeros en Secuencia**: test by inserting first n numbers, from 1 to n
![](https://github.com/Zubieta/Data_Structures_And_Algorithms_I/blob/master/Screenshots/DS1_Sequence.png?raw=true)

**Numeros Aleatorios**: test by inserting insert n random numbers 
![](https://github.com/Zubieta/Data_Structures_And_Algorithms_I/blob/master/Screenshots/DS1_Random.png?raw=true)

**Insertar** : Insert a given number

**Buscar** : Search for a given number
![](https://github.com/Zubieta/Data_Structures_And_Algorithms_I/blob/master/Screenshots/DS1_Search.png?raw=true)

**Eliminar** : Delete a given number
![](https://github.com/Zubieta/Data_Structures_And_Algorithms_I/blob/master/Screenshots/DS1_Delete.png?raw=true)
{'fraction_non_alphanumeric': 0.11466260781329274, 'fraction_numerical': 0.0076103500761035, 'mean_word_length': 5.954144620811287, 'pattern_counts': {'":': 0, '<': 7, '<?xml version=': 0, '>': 7, 'https://': 16, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 2, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '4751432', 'n_tokens_mistral': 1344, 'n_tokens_neox': 1251, 'n_words': 353}