<commit_before>Algorithms from "Introduction to Algorithms" written in Python

# Quick Usage

`./testsort.py heap.minheap`

# TODO

* Sorts
  * Counting sort
  * Radix sort

* Trees
  * 2-3-4 tree
  * Splay tree

* Hash tables
  * Open addressing
<commit_msg>README.md: updated<commit_after>Algorithms from "Introduction to Algorithms" written in Python

# Quick Usage

`./testsort.py heap.minheap` for sorting algos
`./test.py hashtable.openaddressing` for other algos (must implement func `test`)

# TODO

* Trees
  * 2-3-4 tree
  * Splay tree

{'fraction_non_alphanumeric': 0.09706959706959707, 'fraction_numerical': 0.01098901098901099, 'mean_word_length': 3.756521739130435, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '5228373', 'n_tokens_mistral': 193, 'n_tokens_neox': 186, 'n_words': 58}