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

#Data Structures and Algorithms I Course Project
The Final Project for this course was to implement a B-Tree with a GUI. It has manual input to search for a value, enter it or delete it, to load numbers from a text file, in order from 0 to n, and n random numbers. It takes a while to load because it downloads the background image from the internet.

###Input the tree order
![](https://raw2.github.com/Zubieta/Data_Structures_And_Algorithms_I/master/Screenshots/DS1_Order.png)

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

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

**Prueba**: Test
![](https://raw2.github.com/Zubieta/Data_Structures_And_Algorithms_I/master/Screenshots/DS1_Test.png)
**Cargar Caso**: Load numbers from a file
**Numeros en Secuencia**: first n numbers
![](https://raw2.github.com/Zubieta/Data_Structures_And_Algorithms_I/master/Screenshots/DS1_Sequence.png)
**Numeros Aleatorios**: n random numbers 
![](https://raw2.github.com/Zubieta/Data_Structures_And_Algorithms_I/master/Screenshots/DS1_Random.png)

![](https://raw2.github.com/Zubieta/Data_Structures_And_Algorithms_I/master/Screenshots/DS1_Insert.png)
**Insertar** : Insert

![](https://raw2.github.com/Zubieta/Data_Structures_And_Algorithms_I/master/Screenshots/DS1_Search.png)
**Buscar** : Search

![](https://raw2.github.com/Zubieta/Data_Structures_And_Algorithms_I/master/Screenshots/DS1_Delete.png)
**Eliminar** : Delete
<commit_msg>added readme<commit_after>##<NAME>, <NAME>
####EAFIT University, 2011-2 

#Data Structures and Algorithms I Course Project
The Final Project for this course was to implement a B-Tree with a GUI. 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.

###Input the tree order
![](https://raw2.github.com/Zubieta/Data_Structures_And_Algorithms_I/master/Screenshots/DS1_Order.png)

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

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

**Prueba**: Test
![](https://raw2.github.com/Zubieta/Data_Structures_And_Algorithms_I/master/Screenshots/DS1_Test.png)
**Cargar Caso**: Load numbers from a file

**Numeros en Secuencia**: first n numbers
![](https://raw2.github.com/Zubieta/Data_Structures_And_Algorithms_I/master/Screenshots/DS1_Sequence.png)

**Numeros Aleatorios**: n random numbers 
![](https://raw2.github.com/Zubieta/Data_Structures_And_Algorithms_I/master/Screenshots/DS1_Random.png)

**Insertar** : Insert
![](https://raw2.github.com/Zubieta/Data_Structures_And_Algorithms_I/master/Screenshots/DS1_Insert.png)

**Buscar** : Search
![](https://raw2.github.com/Zubieta/Data_Structures_And_Algorithms_I/master/Screenshots/DS1_Search.png)

**Eliminar** : Delete
![](https://raw2.github.com/Zubieta/Data_Structures_And_Algorithms_I/master/Screenshots/DS1_Delete.png)

{'fraction_non_alphanumeric': 0.1292867981790592, 'fraction_numerical': 0.01456752655538695, 'mean_word_length': 6.2759381898454745, 'pattern_counts': {'":': 0, '<': 7, '<?xml version=': 0, '>': 7, 'https://': 18, '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': '2785076', 'n_tokens_mistral': 1232, 'n_tokens_neox': 1137, 'n_words': 234}