<commit_before># dsa-cozy-corner
A collection of implementations of prominent algorithms and data strucutres by U-students @ LiU<commit_msg>Add a suggestion list<commit_after># dsa-cozy-corner
A collection of implementations of prominent algorithms and data strucutres by U-students @ LiU

## Implementation suggestions
The following lists are some suggestions for algorithms and data structures which
has not yet been implemented or only implemented in a very limited fashion.
You can of cource pick any algorithm/data structure you want!

Algorithms:

- [] AC-3
- [] Hill Climbing (normal and enforced)
- [] A*
- [] DFS
- [] BFS
- [] Quicksort
- [] Mergesort
- [] Heapsort
- [] Insertion sort
- [] 2opt
- [] Alpha-Beta pruning
- [] Minimax

Data structures
- [] Search trees
- [] Balanced trees (AVL, Splay and Red-Black)
- [] Persistant rope
- [] Priority Queue (min or max heap)
- [] Prefix tree
{'fraction_non_alphanumeric': 0.09343715239154617, 'fraction_numerical': 0.002224694104560623, 'mean_word_length': 4.084745762711864, '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': '431762', 'n_tokens_mistral': 267, 'n_tokens_neox': 259, 'n_words': 108}