<commit_before>\##### Coursera: Design and Analysis of Algorithms 

<NAME>

C++ implementations

Practice with CMake and Google Test/ Google Mock

1.Inversions - Merge sort and counting inversions

2.QuickSort - QuickSort and counting comparisons

3.MinimumCut - Randomized contraction for counting minimum cuts of an undirected graph

4.Strongly Connected Components - Kosaraju's algorithm for computing strongly connected components<commit_msg>update main README<commit_after>\##### Coursera: Design and Analysis of Algorithms 

<NAME>

C++ implementations

Practice with CMake and Google Test/ Google Mock

1.Inversions - Merge sort and counting inversions

2.QuickSort - QuickSort and counting comparisons

3.MinimumCut - Randomized contraction for counting minimum cuts of an undirected graph

4.Strongly Connected Components - Kosaraju's algorithm for computing strongly connected components

5.Shortest Paths - Dijkstra's algorithm for computing shortest paths
{'fraction_non_alphanumeric': 0.052740434332988625, 'fraction_numerical': 0.009307135470527405, 'mean_word_length': 5.165605095541402, 'pattern_counts': {'":': 0, '<': 5, '<?xml version=': 0, '>': 5, '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': '2781967', 'n_tokens_mistral': 260, 'n_tokens_neox': 237, 'n_words': 109}