diff --git a/build/lib/MANIFEST.in b/build/lib/MANIFEST.in deleted file mode 100644 index 2dc25e4..0000000 --- a/build/lib/MANIFEST.in +++ /dev/null @@ -1,18 +0,0 @@ -include data/stats.md -include data/stats.txt -include Pipfile -include Pipfile.lock -include dumps/category.json -include dumps/catMap.p -include dumps/trie.p -include services/__init__.py -include services/category.py -include services/code.py -include services/getSearchResults.py -include services/index.py -include services/openfalcon.py -include services/recommendations.py -include services/recommendationUtils.py -include services/search.py -include services/stats.py -include services/trie.py \ No newline at end of file diff --git a/build/lib/Pipfile b/build/lib/Pipfile deleted file mode 100755 index b769598..0000000 --- a/build/lib/Pipfile +++ /dev/null @@ -1,14 +0,0 @@ -[[source]] -name = "pypi" -url = "https://pypi.org/simple" -verify_ssl = true - -[dev-packages] -black = "*" - -[packages] -gitpython = "*" -pygtrie = "*" - -[requires] -python_version = "3.6" diff --git a/build/lib/Pipfile.lock b/build/lib/Pipfile.lock deleted file mode 100755 index 77d6636..0000000 --- a/build/lib/Pipfile.lock +++ /dev/null @@ -1,50 +0,0 @@ -{ - "_meta": { - "hash": { - "sha256": "878038b22271eca819f66407ba435e825f1cefc9817105ff69ec80a19c6ab1d6" - }, - "pipfile-spec": 6, - "requires": { - "python_version": "3.6" - }, - "sources": [ - { - "name": "pypi", - "url": "https://pypi.org/simple", - "verify_ssl": true - } - ] - }, - "default": { - "gitdb2": { - "hashes": [ - "sha256:83361131a1836661a155172932a13c08bda2db3674e4caa32368aa6eb02f38c2", - "sha256:e3a0141c5f2a3f635c7209d56c496ebe1ad35da82fe4d3ec4aaa36278d70648a" - ], - "version": "==2.0.5" - }, - "gitpython": { - "hashes": [ - "sha256:563221e5a44369c6b79172f455584c9ebbb122a13368cc82cb4b5addff788f82", - "sha256:8237dc5bfd6f1366abeee5624111b9d6879393d84745a507de0fda86043b65a8" - ], - "index": "pypi", - "version": "==2.1.11" - }, - "pygtrie": { - "hashes": [ - "sha256:28261896d9fea0439d5ee521403812b444c041036d2335b86dbf9c9c2ec1a703" - ], - "index": "pypi", - "version": "==2.3" - }, - "smmap2": { - "hashes": [ - "sha256:0555a7bf4df71d1ef4218e4807bbf9b201f910174e6e08af2e138d4e517b4dde", - "sha256:29a9ffa0497e7f2be94ca0ed1ca1aa3cd4cf25a1f6b4f5f87f74b46ed91d609a" - ], - "version": "==2.0.5" - } - }, - "develop": {} -} diff --git a/build/lib/README.md b/build/lib/README.md deleted file mode 100755 index 966eb19..0000000 --- a/build/lib/README.md +++ /dev/null @@ -1,78 +0,0 @@ -# Falcon - -Falcon is a library which allows you to use the [Cosmos](https://github.com/OpenGenus/cosmos) library in a convenient way. Currently it has features like Search, Recommendation, etc - -This repository is based out in python scripts and is currently ported to python 3.x, Now lets begin with the features. - -## Installation -Install pipenv and add it to path: -```bash -pip3 install --user pipenv -``` - -then install the dependencies from the root of project: -```bash -pipenv shell -pipenv install -``` - -## Usage - -### openfalcon -You can make use of the openfalcon interface for easily using all the services available in the repo. Start by installing it from root of project. -```bash -pip3 install --user -e . -``` -now for usage just look up the help or refer the below sections to understand what each of the service can offer. - -##### Clone the Repository -To start first we need to clone the cosmos repository using the ```index.py``` file by writing ```openfalcon --clone``` command. - -##### Search For Files - -A simple search for files in the cosmos repo can be done using the command ```openfalcon --search="greedy algorithms" --results=3 ``` here we have two options -- **search(Required)** : We enter the search term here. -- **results(Optional)** : The integer value shows the top number of results, like above shows top 3 results and not specifying any values for it will result in showing ALL results for search. -- **Results of above command :** -``` -code greedy algorithms -greedy algorithms -greedy algorithms kruskal minimum spanning tree -``` -##### Recommendations - -User can seek recommendation for search terms using the command ```openfalcon --recommend artificial --type parent --top 3``` , here we have two options -- **recommend(Required)** : We enter the recommendation term here. -- **type(Optional)** : By default this value is all which will search for the term in complete directory tree, if parent is entered then only parent directories are recommended and if child is entered then only child directories can be recommended. -- **top(Optional)** : Missing the parameters results in showing of all results and we can enter integers to restrict the number of returned results. - -##### Edit/Delete Code -The file ```code.py``` can be used to search the code in a given language in the complete cosmos directory and can be used to edit/ delete code, can be used using the command ```openfalcon --code --term linear --language cpp ``` , this will open the top file matching with term linear in cpp -- **term(Required)** : We enter the search term here. -- **language(Required)** : We enter the language in which we want the final results, the value of the parameter is the extension of language in which code is required. -- **Results of above command** -``` -search linear search -search linear search -artificial intelligence Linear Regression -[{'category': 'linear search', 'description': 'search linear search', 'location': '/code/search/src/linear_search'}, {'category': 'Linear Regression', 'description': 'artificial intelligence Linear Regression', 'location': '/code/artificial_intelligence/src/Linear_Regression'}] -``` - -### Generate List of Implemented Algorithms -#### What's the stats script? -The stats script deals with generating a progress list of the cosmos repo, by taking into account all algorithms currently existing in the repo and categorizing them based on the languages used to implement them. - -#### How to run? -**make sure that you're in the falcon project root directory** - -#### for generating the output in txt file :- -```bash -openfalcon --stats -f txt > ./STATS.txt -``` - -#### for generating the output in md file :- -```bash -openfalcon --stats -f md > ./STATS.md -``` - -This library is under development, please feel free to report any issues or request a features. diff --git a/build/lib/data/stats.md b/build/lib/data/stats.md deleted file mode 100755 index 417763b..0000000 --- a/build/lib/data/stats.md +++ /dev/null @@ -1,771 +0,0 @@ -This is the progress list of [Cosmos](https://github.com/OpenGenus/cosmos/) | Updated on: 2019-06-08 - - -# [ARTIFICIAL INTELLIGENCE](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence) -| ARTIFICIAL INTELLIGENCE | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [a star](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/a_star/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [artificial neural network](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/artificial_neural_network/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [autoenncoder](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/autoenncoder/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [canny](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/image_processing/canny/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [convolutional neural network](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/convolutional_neural_network/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [dbscan clustering](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/dbscan_clustering/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [decision tree](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/decision_tree/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [erode dilate](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/image_processing/erode_dilate/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [factorization machines](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/factorization_machines/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [gaussian naive bayes](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/gaussian_naive_bayes/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [gbestPSO](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/particle_swarm_optimization/gbestPSO/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [hierachical clustering](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/hierachical_clustering/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [houghtransform](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/image_processing/houghtransform/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [image processing](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/image_processing/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | -| [image stitching](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/image_processing/image_stitching/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [isodata clustering](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/isodata_clustering/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [k means](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/k_means/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | . | -| [k nearest neighbours](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/k_nearest_neighbours/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [lbestPSO](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/particle_swarm_optimization/lbestPSO/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [linear regression](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/linear_regression/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | . | -| [logistic regression](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/logistic_regression/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [minimax](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/minimax/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [naive bayes](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/naive_bayes/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | . | -| [neural network](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/neural_network/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [neural style transfer](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/neural_style_transfer/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [nsm matlab](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/nearest_sequence_memory/nsm_matlab/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [perceptron](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/perceptron/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [prewittfilter](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/image_processing/prewittfilter/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [principal component analysis](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/principal_component_analysis/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [q learning](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/q_learning/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [restricted boltzmann machine](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/restricted_boltzmann_machine/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [sat](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/sat/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [sobelfilter](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/image_processing/sobelfilter/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [src](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [support vector machine](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/support_vector_machine/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [tsp](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/tsp/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| | 0 | 0 | 3 | 10 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 2 | 0 | 5 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 19 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 3 | 0 | 0 | 0 | 0 | - - -# [BACKTRACKING](https://github.com/OpenGenus/cosmos/tree/master/code/backtracking) -| BACKTRACKING | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [algorithm x](https://github.com/OpenGenus/cosmos/tree/master/code/backtracking/src/algorithm_x/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [crossword puzzle](https://github.com/OpenGenus/cosmos/tree/master/code/backtracking/src/crossword_puzzle/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [knight tour](https://github.com/OpenGenus/cosmos/tree/master/code/backtracking/src/knight_tour/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | -| [m coloring problem](https://github.com/OpenGenus/cosmos/tree/master/code/backtracking/src/m_coloring_problem/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [n queen](https://github.com/OpenGenus/cosmos/tree/master/code/backtracking/src/n_queen/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | -| [number of ways in maze](https://github.com/OpenGenus/cosmos/tree/master/code/backtracking/src/number_of_ways_in_maze/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | -| [partitions of number](https://github.com/OpenGenus/cosmos/tree/master/code/backtracking/src/partitions_of_number/) | . | . | . | ✔️ | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | -| [partitions of set](https://github.com/OpenGenus/cosmos/tree/master/code/backtracking/src/partitions_of_set/) | . | . | . | ✔️ | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [permutations of string](https://github.com/OpenGenus/cosmos/tree/master/code/backtracking/src/permutations_of_string/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [powerset](https://github.com/OpenGenus/cosmos/tree/master/code/backtracking/src/powerset/) | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [rat in a maze](https://github.com/OpenGenus/cosmos/tree/master/code/backtracking/src/rat_in_a_maze/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [subset sum](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/subset_sum/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [sudoku solve](https://github.com/OpenGenus/cosmos/tree/master/code/backtracking/src/sudoku_solve/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | -| | 0 | 0 | 7 | 10 | 0 | 0 | 0 | 0 | 0 | 0 | 8 | 0 | 1 | 6 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 6 | 0 | 0 | 0 | 5 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | - - -# [BIT MANIPULATION](https://github.com/OpenGenus/cosmos/tree/master/code/bit_manipulation) -| BIT MANIPULATION | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [addition using bits](https://github.com/OpenGenus/cosmos/tree/master/code/bit_manipulation/src/addition_using_bits/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | -| [bit division](https://github.com/OpenGenus/cosmos/tree/master/code/bit_manipulation/src/bit_division/) | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [byte swapper](https://github.com/OpenGenus/cosmos/tree/master/code/bit_manipulation/src/byte_swapper/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [convert number binary](https://github.com/OpenGenus/cosmos/tree/master/code/bit_manipulation/src/convert_number_binary/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | ✔️ | ✔️ | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [count set bits](https://github.com/OpenGenus/cosmos/tree/master/code/bit_manipulation/src/count_set_bits/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | -| [flip bits](https://github.com/OpenGenus/cosmos/tree/master/code/bit_manipulation/src/flip_bits/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [hamming distance](https://github.com/OpenGenus/cosmos/tree/master/code/bit_manipulation/src/hamming_distance/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [invert bit](https://github.com/OpenGenus/cosmos/tree/master/code/bit_manipulation/src/invert_bit/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [lonely integer](https://github.com/OpenGenus/cosmos/tree/master/code/bit_manipulation/src/lonely_integer/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | -| [magic number](https://github.com/OpenGenus/cosmos/tree/master/code/bit_manipulation/src/magic_number/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [maximum xor value](https://github.com/OpenGenus/cosmos/tree/master/code/bit_manipulation/src/maximum_xor_value/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [power of 2](https://github.com/OpenGenus/cosmos/tree/master/code/bit_manipulation/src/power_of_2/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | ✔️ | . | -| [subset generation](https://github.com/OpenGenus/cosmos/tree/master/code/bit_manipulation/src/subset_generation/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [sum binary numbers](https://github.com/OpenGenus/cosmos/tree/master/code/bit_manipulation/src/sum_binary_numbers/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [sum equals xor](https://github.com/OpenGenus/cosmos/tree/master/code/bit_manipulation/src/sum_equals_xor/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [thrice unique number](https://github.com/OpenGenus/cosmos/tree/master/code/bit_manipulation/src/thrice_unique_number/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [twice unique number](https://github.com/OpenGenus/cosmos/tree/master/code/bit_manipulation/src/twice_unique_number/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [xor swap](https://github.com/OpenGenus/cosmos/tree/master/code/bit_manipulation/src/xor_swap/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| | 0 | 0 | 13 | 15 | 0 | 0 | 0 | 0 | 0 | 0 | 5 | 0 | 1 | 10 | 8 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 13 | 0 | 0 | 0 | 2 | 0 | 0 | 0 | 0 | 0 | 0 | 3 | 0 | - - -# [CELLULAR AUTOMATON](https://github.com/OpenGenus/cosmos/tree/master/code/cellular_automaton) -| CELLULAR AUTOMATON | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [conways game of life](https://github.com/OpenGenus/cosmos/tree/master/code/cellular_automaton/src/conways_game_of_life/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | -| [elementary cellular automata](https://github.com/OpenGenus/cosmos/tree/master/code/cellular_automaton/src/elementary_cellular_automata/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [genetic algorithm](https://github.com/OpenGenus/cosmos/tree/master/code/cellular_automaton/src/genetic_algorithm/) | . | . | . | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [langtons ant](https://github.com/OpenGenus/cosmos/tree/master/code/cellular_automaton/src/langtons_ant/) | . | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [von neumann cellular automata](https://github.com/OpenGenus/cosmos/tree/master/code/cellular_automaton/src/von_neumann_cellular_automata/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| | 0 | 0 | 2 | 3 | 0 | 0 | 0 | 0 | 0 | 0 | 2 | 1 | 1 | 4 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 3 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | - - -# [COMPRESSION](https://github.com/OpenGenus/cosmos/tree/master/code/compression) -| COMPRESSION | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [huffman](https://github.com/OpenGenus/cosmos/tree/master/code/compression/src/lossless_compression/huffman/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [lempel ziv welch](https://github.com/OpenGenus/cosmos/tree/master/code/compression/src/lossless_compression/lempel_ziv_welch/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| | 0 | 0 | 0 | 2 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | - - -# [COMPUTATIONAL GEOMETRY](https://github.com/OpenGenus/cosmos/tree/master/code/computational_geometry) -| COMPUTATIONAL GEOMETRY | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [2d line intersection](https://github.com/OpenGenus/cosmos/tree/master/code/computational_geometry/src/2d_line_intersection/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | ✔️ | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | -| [2d separating axis test](https://github.com/OpenGenus/cosmos/tree/master/code/computational_geometry/src/2d_separating_axis_test/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [area of polygon](https://github.com/OpenGenus/cosmos/tree/master/code/computational_geometry/src/area_of_polygon/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [area of triangle](https://github.com/OpenGenus/cosmos/tree/master/code/computational_geometry/src/area_of_triangle/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | -| [axis aligned bounding box collision](https://github.com/OpenGenus/cosmos/tree/master/code/computational_geometry/src/axis_aligned_bounding_box_collision/) | . | . | . | ✔️ | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [bresenham circle](https://github.com/OpenGenus/cosmos/tree/master/code/computational_geometry/src/bresenham_circle/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [bresenham line](https://github.com/OpenGenus/cosmos/tree/master/code/computational_geometry/src/bresenham_line/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [chans algorithm](https://github.com/OpenGenus/cosmos/tree/master/code/computational_geometry/src/chans_algorithm/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [cohen sutherland lineclip](https://github.com/OpenGenus/cosmos/tree/master/code/computational_geometry/src/cohen_sutherland_lineclip/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [dda line](https://github.com/OpenGenus/cosmos/tree/master/code/computational_geometry/src/dda_line/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [distance between points](https://github.com/OpenGenus/cosmos/tree/master/code/computational_geometry/src/distance_between_points/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | -| [graham scan](https://github.com/OpenGenus/cosmos/tree/master/code/computational_geometry/src/graham_scan/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [halfplane intersection](https://github.com/OpenGenus/cosmos/tree/master/code/computational_geometry/src/halfplane_intersection/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [jarvis march](https://github.com/OpenGenus/cosmos/tree/master/code/computational_geometry/src/jarvis_march/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [liangBarskyAlgo](https://github.com/OpenGenus/cosmos/tree/master/code/computational_geometry/src/liangBarskyAlgo/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [quickhull](https://github.com/OpenGenus/cosmos/tree/master/code/computational_geometry/src/quickhull/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [sphere tetrahedron intersection](https://github.com/OpenGenus/cosmos/tree/master/code/computational_geometry/src/sphere_tetrahedron_intersection/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [sutherland hodgeman clipping](https://github.com/OpenGenus/cosmos/tree/master/code/computational_geometry/src/sutherland_hodgeman_clipping/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| | 0 | 0 | 8 | 18 | 0 | 0 | 0 | 0 | 0 | 0 | 3 | 0 | 2 | 7 | 3 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 6 | 0 | 0 | 1 | 2 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | - - -# [COMPUTER GRAPHICS](https://github.com/OpenGenus/cosmos/tree/master/code/computer_graphics) -| COMPUTER GRAPHICS | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [diamond square](https://github.com/OpenGenus/cosmos/tree/master/code/computer_graphics/src/diamond_square/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | - - -# [CRYPTOGRAPHY](https://github.com/OpenGenus/cosmos/tree/master/code/cryptography) -| CRYPTOGRAPHY | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [aes 128](https://github.com/OpenGenus/cosmos/tree/master/code/cryptography/src/aes_128/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [aes csharp](https://github.com/OpenGenus/cosmos/tree/master/code/cryptography/src/aes_128/aes_csharp/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | -| [affine cipher](https://github.com/OpenGenus/cosmos/tree/master/code/cryptography/src/affine_cipher/) | . | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [atbash cipher](https://github.com/OpenGenus/cosmos/tree/master/code/cryptography/src/atbash_cipher/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [autokey cipher](https://github.com/OpenGenus/cosmos/tree/master/code/cryptography/src/autokey_cipher/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [baconian cipher](https://github.com/OpenGenus/cosmos/tree/master/code/cryptography/src/baconian_cipher/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | -| [caesar cipher](https://github.com/OpenGenus/cosmos/tree/master/code/cryptography/src/caesar_cipher/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | ✔️ | ✔️ | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | -| [columnar transposition cipher](https://github.com/OpenGenus/cosmos/tree/master/code/cryptography/src/columnar_transposition_cipher/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [example](https://github.com/OpenGenus/cosmos/tree/master/code/cryptography/src/aes_128/aes_csharp/example/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | -| [huffman encoding](https://github.com/OpenGenus/cosmos/tree/master/code/cryptography/src/huffman_encoding/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [morse cipher](https://github.com/OpenGenus/cosmos/tree/master/code/cryptography/src/morse_cipher/) | . | ✔️ | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | ✔️ | . | . | ✔️ | . | . | ✔️ | . | . | ✔️ | . | . | . | -| [polybius cipher](https://github.com/OpenGenus/cosmos/tree/master/code/cryptography/src/polybius_cipher/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [porta cipher](https://github.com/OpenGenus/cosmos/tree/master/code/cryptography/src/porta_cipher/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [rail fence cipher](https://github.com/OpenGenus/cosmos/tree/master/code/cryptography/src/rail_fence_cipher/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | -| [rot13 cipher](https://github.com/OpenGenus/cosmos/tree/master/code/cryptography/src/rot13_cipher/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | -| [rsa](https://github.com/OpenGenus/cosmos/tree/master/code/cryptography/src/rsa/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | -| [rsa digital signature](https://github.com/OpenGenus/cosmos/tree/master/code/cryptography/src/rsa_digital_signature/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [runningkey cipher](https://github.com/OpenGenus/cosmos/tree/master/code/cryptography/src/runningkey_cipher/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [sha 256](https://github.com/OpenGenus/cosmos/tree/master/code/cryptography/src/sha/sha_256/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [vigenere cipher](https://github.com/OpenGenus/cosmos/tree/master/code/cryptography/src/vigenere_cipher/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | ✔️ | ✔️ | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | -| | 0 | 1 | 7 | 10 | 0 | 0 | 0 | 0 | 0 | 0 | 2 | 1 | 2 | 8 | 5 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 4 | 0 | 0 | 0 | 15 | 0 | 0 | 6 | 0 | 0 | 2 | 0 | 0 | 1 | 0 | 4 | 0 | - - -# [DATA STRUCTURES](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures) -| DATA STRUCTURES | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [aa tree](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/binary_tree/aa_tree/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [abstract stack](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/stack/abstract_stack/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [arraystack](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/stack/abstract_stack/cpp/arraystack/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [avl tree](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/binary_tree/avl_tree/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | -| [b tree](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/b_tree/b_tree/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | . | -| [b tree c](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/b_tree/b_tree/b_tree_c/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [bag](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/bag/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [balanced expression](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/stack/balanced_expression/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [binary heap](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/binary_heap/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [binomial heap](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/heap/binomial_heap/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | -| [bloom filter](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/hashs/bloom_filter/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | -| [bottom view binary tree](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/binary_tree/binary_tree/tree/bottom_view_binary_tree/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [c](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms/src/finite_automata/c/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [circular buffer](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/queue/circular_buffer/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [circular linked list](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/list/circular_linked_list/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [convert to doubly linked list](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/binary_tree/binary_tree/convert_to_doubly_linked_list/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [cpp](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/stack/abstract_stack/cpp/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [delete](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/list/singly_linked_list/operations/delete/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [detect cycle](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/list/singly_linked_list/operations/detect_cycle/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [diameter](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/binary_tree/binary_tree/diameter/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [double ended queue](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/queue/double_ended_queue/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [doubly linked list](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/list/doubly_linked_list/) | . | . | . | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | . | -| [fenwick tree](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/multiway_tree/fenwick_tree/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [find](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/list/singly_linked_list/operations/find/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [from inorder and postorder](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/binary_tree/binary_tree/make_binary_tree/from_inorder_and_postorder/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [from inorder and preorder](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/binary_tree/binary_tree/make_binary_tree/from_inorder_and_preorder/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [hash table](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/hashs/hash_table/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | ✔️ | . | . | ✔️ | . | -| [infix to postfix](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/stack/infix_to_postfix/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [infix to prefix](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/stack/infix_to_prefix/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [insertion](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/list/singly_linked_list/operations/insertion/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [interval tree](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/space_partitioning_tree/interval_tree/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [is balance](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/binary_tree/binary_tree/is_balance/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [is binary tree](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/binary_tree/binary_tree/is_binary_tree/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [is same](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/binary_tree/binary_tree/is_same/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [kd tree](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/space_partitioning_tree/kd_tree/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [left view](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/binary_tree/binary_tree/traversal/preorder/left_view/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [leftist tree](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/heap/priority_queue/leftist_tree/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [linked list](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/linked_list/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [make mirror tree](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/binary_tree/binary_tree/make_mirror_tree/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [max heap](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/heap/max_heap/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [maximum height](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/binary_tree/binary_tree/maximum_height/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [menu interface](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/list/doubly_linked_list/menu_interface/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [merge sorted](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/list/singly_linked_list/operations/merge_sorted/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [min heap](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/heap/min_heap/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | ✔️ | . | . | . | . | -| [minimum height](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/binary_tree/binary_tree/minimum_height/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [n th node linked list](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/list/singly_linked_list/operations/n_th_node_linked_list/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [node](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/binary_tree/binary_tree/node/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [operations](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/list/circular_linked_list/operations/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [pairing heap](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/heap/pairing_heap/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | ✔️ | -| [path sum](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/binary_tree/binary_tree/path_sum/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [postfix evaluation](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/stack/postfix_evaluation/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | ✔️ | . | . | . | . | . | . | -| [prefix to postfix](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/stack/prefix_to_postfix/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [print reverse](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/list/singly_linked_list/operations/print_reverse/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | ✔️ | . | . | . | . | . | . | . | -| [priority queue](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/heap/priority_queue/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [push](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/list/singly_linked_list/operations/push/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [quad tree](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/space_partitioning_tree/quad_tree/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | -| [queue](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/queue/queue/) | . | . | ✔️ | ✔️ | . | . | ✔️ | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | ✔️ | . | . | ✔️ | . | -| [queue stream](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/queue/queue_stream/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | -| [queue using linked list](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/queue/queue_using_linked_list/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | -| [queue using stack](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/queue/queue_using_stack/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | ✔️ | . | . | . | . | . | . | -| [red black tree](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/multiway_tree/red_black_tree/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | ✔️ | . | . | . | . | . | . | . | -| [reverse](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/list/singly_linked_list/operations/reverse/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [reverse queue](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/queue/reverse_queue/) | . | . | . | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | . | -| [reverse stack](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/stack/reverse_stack/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | -| [right threaded](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/binary_tree/binary_tree/traversal/inorder/right_threaded/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [right view](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/binary_tree/binary_tree/traversal/preorder/right_view/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [rope](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/binary_tree/rope/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [rotate](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/list/singly_linked_list/operations/rotate/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [segment tree](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/segment_tree/) | ✔️ | . | . | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | ✔️ | . | . | . | . | . | . | . | -| [serializer](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/binary_tree/binary_tree/serializer/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [singly linked list](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/list/singly_linked_list/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | ✔️ | . | . | ✔️ | . | -| [skip list](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/list/skip_list/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | ✔️ | . | . | ✔️ | . | . | . | . | -| [soft heap](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/heap/soft_heap/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [sort](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/list/singly_linked_list/operations/sort/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [sort stack](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/stack/sort_stack/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [splay tree](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/multiway_tree/splay_tree/) | . | . | . | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | -| [stack](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/stack/stack/) | . | . | ✔️ | ✔️ | . | . | ✔️ | . | ✔️ | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | ✔️ | . | . | ✔️ | . | -| [suffix array](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms/src/suffix_array/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [sum left](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/binary_tree/binary_tree/path_sum/sum_left/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [treap](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/binary_tree/treap/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | -| [tree](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/binary_tree/binary_tree/tree/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | ✔️ | . | . | . | . | -| [trie](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/tree/trie/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | ✔️ | . | . | ✔️ | . | . | ✔️ | . | -| [two three tree](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/b_tree/two_three_tree/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | -| [unclassified](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/list/singly_linked_list/operations/unclassified/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [union find](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/multiway_tree/union_find/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | ✔️ | . | . | . | . | . | . | . | -| [van emde boas tree](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/van_emde_boas_tree/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [xor linked list](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/list/xor_linked_list/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [zigzag](https://github.com/OpenGenus/cosmos/tree/master/code/data_structures/src/tree/binary_tree/binary_tree/traversal/zigzag/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| | 1 | 0 | 42 | 66 | 0 | 0 | 2 | 0 | 1 | 0 | 15 | 0 | 1 | 41 | 13 | 0 | 0 | 2 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 40 | 0 | 0 | 10 | 2 | 11 | 2 | 1 | 16 | 0 | 0 | 7 | 1 | - - -# [DESIGN PATTERN](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern) -| DESIGN PATTERN | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [OOP patterns](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/OOP_patterns/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [adapter](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/oop_patterns/adapter/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [arrow](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/functional_patterns/functional_patterns/scala/src/main/scala/arrows/arrow/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | -| [bifunctor](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/functional_patterns/functional_patterns/scala/src/main/scala/functors/bifunctor/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | -| [builder](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/oop_patterns/builder/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [builder pattern](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/builder_pattern/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | -| [comonad](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/functional_patterns/functional_patterns/scala/src/main/scala/monads/comonad/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | -| [contravariant](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/functional_patterns/functional_patterns/scala/src/main/scala/functors/contravariant/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | -| [demo](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/oop_patterns/proxy/demo/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [facade](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/oop_patterns/facade/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [factory](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/oop_patterns/factory/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [functor](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/functional_patterns/functional_patterns/scala/src/main/scala/functors/functor/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | -| [gifts](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/oop_patterns/factory/gifts/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [gonad](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/functional_patterns/functional_patterns/scala/src/main/scala/monads/gonad/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | -| [gym](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/oop_patterns/facade/daily/tasks/gym/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [iterator pattern](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/iterator_pattern/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [job](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/oop_patterns/facade/daily/tasks/job/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [monad](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/functional_patterns/functional_patterns/scala/src/main/scala/monads/costate/monad/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | -| [multifunctor](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/functional_patterns/functional_patterns/scala/src/main/scala/functors/multifunctor/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | -| [network](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/oop_patterns/observer_java/observer/network/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [observer](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/oop_patterns/observer_java/observer/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [observer java](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/oop_patterns/observer_java/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [observer pattern](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/oop_patterns/observer_pattern/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | -| [policy based design](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/policy_based_design/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [profunctor](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/functional_patterns/functional_patterns/scala/src/main/scala/functors/profunctor/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | -| [proxy](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/oop_patterns/proxy/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [routine](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/oop_patterns/facade/daily/tasks/morning/routine/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [scala](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/functional_patterns/functional_patterns/scala/src/main/scala/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | -| [singleton pattern](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/oop_patterns/singleton_pattern/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | -| [soldiers](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/oop_patterns/adapter/soldiers/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [src](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [tasks](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/oop_patterns/facade/daily/tasks/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| | 0 | 0 | 0 | 3 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 17 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 4 | 0 | 0 | 0 | 1 | 10 | 0 | 0 | 0 | 0 | 0 | 2 | 0 | - - -# [DIVIDE CONQUER](https://github.com/OpenGenus/cosmos/tree/master/code/divide_conquer) -| DIVIDE CONQUER | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [closest pair of points](https://github.com/OpenGenus/cosmos/tree/master/code/divide_conquer/src/closest_pair_of_points/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [factorial](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/factorial/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [inversion count](https://github.com/OpenGenus/cosmos/tree/master/code/divide_conquer/src/inversion_count/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [karatsuba multiplication](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/karatsuba_multiplication/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [maximum contiguous subsequence sum](https://github.com/OpenGenus/cosmos/tree/master/code/divide_conquer/src/maximum_contiguous_subsequence_sum/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [merge sort using divide and conquer](https://github.com/OpenGenus/cosmos/tree/master/code/divide_conquer/src/merge_sort_using_divide_and_conquer/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [quick sort](https://github.com/OpenGenus/cosmos/tree/master/code/divide_conquer/src/quick_sort/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | -| [strassen matrix multiplication](https://github.com/OpenGenus/cosmos/tree/master/code/divide_conquer/src/strassen_matrix_multiplication/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [tournament method to find min max](https://github.com/OpenGenus/cosmos/tree/master/code/divide_conquer/src/tournament_method_to_find_min_max/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [warnock algorithm](https://github.com/OpenGenus/cosmos/tree/master/code/divide_conquer/src/warnock_algorithm/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [x power y](https://github.com/OpenGenus/cosmos/tree/master/code/divide_conquer/src/x_power_y/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| | 0 | 0 | 6 | 6 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 4 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 6 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | - - -# [DYNAMIC PROGRAMMING](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming) -| DYNAMIC PROGRAMMING | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [array median](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/array_median/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | -| [binomial coefficient](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/binomial_coefficient/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [boolean parenthesization](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/boolean_parenthesization/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | . | -| [box stacking](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/box_stacking/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [coin change](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/coin_change/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [digit dp](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/digit_dp/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [edit distance](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/edit_distance/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | -| [egg dropping puzzle](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/egg_dropping_puzzle/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [factorial](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/factorial/) | . | . | ✔️ | . | . | . | ✔️ | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | -| [fibonacci](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/fibonacci/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [knapsack](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/knapsack/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [largest sum contiguous subarray](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/largest_sum_contiguous_subarray/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [longest bitonic sequence](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/longest_bitonic_sequence/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [longest common increasing subsequence](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/longest_common_increasing_subsequence/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [longest common subsequence](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/longest_common_subsequence/) | . | . | . | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [longest common substring](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/longest_common_substring/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [longest increasing subsequence](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/longest_increasing_subsequence/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [longest palindromic sequence](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/longest_palindromic_sequence/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [longest palindromic substring](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/longest_palindromic_substring/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [longest repeating subsequence](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/longest_repeating_subsequence/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [matrix chain multiplication](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/matrix_chain_multiplication/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [maximum sum increasing subsequence](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/maximum_sum_increasing_subsequence/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [maximum sum sub matrix](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/maximum_sum_sub_matrix/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [maximum weight independent set of path graph](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/maximum_weight_independent_set_of_path_graph/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [min cost path](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/min_cost_path/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [minimum insertion palindrome](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/minimum_insertion_palindrome/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [no consec ones](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/no_consec_ones/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [numeric keypad problem](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/numeric_keypad_problem/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [optimal binary search tree](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/optimal_binary_search_tree/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [palindrome partition](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/palindrome_partition/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [rod cutting](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/rod_cutting/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [shortest common supersequence](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/shortest_common_supersequence/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [subset sum](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/subset_sum/) | . | . | . | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [tiling problem](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/tiling_problem/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [weighted job scheduling](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/weighted_job_scheduling/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| | 0 | 0 | 17 | 31 | 0 | 0 | 1 | 0 | 0 | 0 | 9 | 0 | 4 | 19 | 7 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 2 | 0 | 0 | 0 | 24 | 0 | 0 | 1 | 3 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | - - -# [FILTERS](https://github.com/OpenGenus/cosmos/tree/master/code/filters) -| FILTERS | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [gaussian filter](https://github.com/OpenGenus/cosmos/tree/master/code/filters/src/gaussian_filter/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [median filter](https://github.com/OpenGenus/cosmos/tree/master/code/filters/src/median_filter/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 2 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | - - -# [GAME THEORY](https://github.com/OpenGenus/cosmos/tree/master/code/game_theory) -| GAME THEORY | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [game of nim next best move](https://github.com/OpenGenus/cosmos/tree/master/code/game_theory/src/game_of_nim_next_best_move/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [game of nim win loss prediction](https://github.com/OpenGenus/cosmos/tree/master/code/game_theory/src/game_of_nim_win_loss_prediction/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [grundy numbers kayle](https://github.com/OpenGenus/cosmos/tree/master/code/game_theory/src/grundy_numbers_kayle/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 3 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | - - -# [GRAPH ALGORITHMS](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms) -| GRAPH ALGORITHMS | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [adjacency lists in c](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/adjacency_lists_graph_representation/adjacency_lists_in_c/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [adjacency matrix c](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/data_structures/adjacency_matrix_c/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [astar algorithm](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/astar_algorithm/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [bellman ford algorithm](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/bellman_ford_algorithm/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [biconnected components](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/biconnected_components/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [bipartite check](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/bipartite_check/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [bipartite checking](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/bipartite_checking/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [boruvka minimum spanning tree](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/boruvka_minimum_spanning_tree/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [breadth first search](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/breadth_first_search/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | ✔️ | . | . | . | . | -| [bridge tree](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/bridge_tree/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [bridges in graph](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/bridges_in_graph/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [bron kerbosch algorithm](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/bron_kerbosch_algorithm/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [centroid decomposition](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/centroid_decomposition/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [connected components](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/connected_components/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [count of ways n](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/count_of_ways_n/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [cut vertices](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/cut_vertices/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [cycle directed graph](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/cycle_directed_graph/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [cycle undirected graph](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/cycle_undirected_graph/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [data structures](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/data_structures/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [depth first search](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/depth_first_search/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | -| [dijkstra shortest path](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/dijkstra_shortest_path/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [dinic maximum flow](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/dinic_maximum_flow/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [eulerian path](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/eulerian_path/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [floyd warshall algorithm](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/floyd_warshall_algorithm/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [ford fulkerson maximum flow](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/ford_fulkerson_maximum_flow/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [graph coloring](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/graph_coloring/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [hamiltonian cycle](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/hamiltonian_cycle/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [hamiltonian path](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/hamiltonian_path/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [johnson algorithm shortest path](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/johnson_algorithm_shortest_path/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [karger minimum cut](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/karger_minimum_cut/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [kruskal minimum spanning tree](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/kruskal_minimum_spanning_tree/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [kuhn maximum matching](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/kuhn_maximum_matching/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [kuhn munkres algorithm](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/kuhn_munkres_algorithm/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [left view binary tree](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/left_view_binary_tree/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [longest path directed acyclic graph](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/longest_path_directed_acyclic_graph/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [matrix transformation](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/matrix_transformation/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | -| [maximum bipartite matching](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/maximum_bipartite_matching/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [postorder from inorder and preorder](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/postorder_from_inorder_and_preorder/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [prim minimum spanning tree](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/prim_minimum_spanning_tree/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [push relabel](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/push_relabel/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [steiner tree](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/steiner_tree/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [strongly connected components](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/strongly_connected_components/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [tarjan algorithm strongly connected components](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/tarjan_algorithm_strongly_connected_components/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [topological sort](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/topological_sort/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | ✔️ | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [transitive closure graph](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/transitive_closure_graph/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [travelling salesman mst](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/travelling_salesman_mst/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| | 0 | 0 | 14 | 32 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 19 | 4 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 21 | 0 | 0 | 2 | 0 | 0 | 0 | 0 | 2 | 0 | 0 | 0 | 0 | - - -# [GREEDY ALGORITHMS](https://github.com/OpenGenus/cosmos/tree/master/code/greedy_algorithms) -| GREEDY ALGORITHMS | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [activity selection](https://github.com/OpenGenus/cosmos/tree/master/code/greedy_algorithms/src/activity_selection/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [dijkstra shortest path](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/dijkstra_shortest_path/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [egyptian fraction](https://github.com/OpenGenus/cosmos/tree/master/code/greedy_algorithms/src/egyptian_fraction/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [fractional knapsack](https://github.com/OpenGenus/cosmos/tree/master/code/greedy_algorithms/src/fractional_knapsack/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | -| [hillclimber](https://github.com/OpenGenus/cosmos/tree/master/code/greedy_algorithms/src/hillclimber/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [huffman coding](https://github.com/OpenGenus/cosmos/tree/master/code/greedy_algorithms/src/huffman_coding/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [job sequencing](https://github.com/OpenGenus/cosmos/tree/master/code/greedy_algorithms/src/job_sequencing/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [k centers](https://github.com/OpenGenus/cosmos/tree/master/code/greedy_algorithms/src/k_centers/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [kruskal minimum spanning tree](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/kruskal_minimum_spanning_tree/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [minimum coins](https://github.com/OpenGenus/cosmos/tree/master/code/greedy_algorithms/src/minimum_coins/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | ✔️ | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [prim minimum spanning tree](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/prim_minimum_spanning_tree/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [warshall](https://github.com/OpenGenus/cosmos/tree/master/code/greedy_algorithms/src/warshall/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| | 0 | 0 | 9 | 9 | 0 | 0 | 0 | 0 | 0 | 0 | 2 | 0 | 2 | 5 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 10 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | - - -# [LANGUAGE](https://github.com/OpenGenus/cosmos/tree/master/code/language) -| LANGUAGE | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [loop](https://github.com/OpenGenus/cosmos/tree/master/code/language/c/loop/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | - - -# [LANGUAGES](https://github.com/OpenGenus/cosmos/tree/master/code/languages) -| LANGUAGES | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [dynamic memory allocation](https://github.com/OpenGenus/cosmos/tree/master/code/languages/c/dynamic_memory_allocation/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [tuple](https://github.com/OpenGenus/cosmos/tree/master/code/languages/python/tuple/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | - - -# [MATHEMATICAL ALGORITHMS](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms) -| MATHEMATICAL ALGORITHMS | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [2sum](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/2sum/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | -| [add polynomials](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/add_polynomials/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [amicable numbers](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/amicable_numbers/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | -| [armstrong numbers](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/armstrong_numbers/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | -| [automorphic numbers](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/automorphic_numbers/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | ✔️ | ✔️ | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | ✔️ | . | . | ✔️ | . | -| [average stream numbers](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/average_stream_numbers/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [babylonian method](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/babylonian_method/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [binomial coefficient](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/binomial_coefficient/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [catalan number](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/catalan_number/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | ✔️ | . | . | . | . | . | . | . | -| [check is square](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/check_is_square/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | ✔️ | ✔️ | ✔️ | . | . | ✔️ | . | . | ✔️ | . | -| [collatz conjecture sequence](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/collatz_conjecture_sequence/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [convolution](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/convolution/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [coprime numbers](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/coprime_numbers/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | -| [count digits](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/count_digits/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | ✔️ | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | ✔️ | . | . | ✔️ | . | -| [count trailing zeroes](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/count_trailing_zeroes/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | ✔️ | . | . | . | . | . | . | . | -| [delannoy number](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/delannoy_number/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [derangements](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/derangements/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [diophantine](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/diophantine/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [divided differences](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/divided_differences/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [elimination](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/gaussian_elimination/scala/src/main/scala/gaussian/elimination/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | -| [euler totient](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/euler_totient/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [exponentiation by squaring](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/exponentiation_power/exponentiation_by_squaring/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [exponentiation power](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/exponentiation_power/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [factorial](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/factorial/) | . | . | ✔️ | ✔️ | ✔️ | . | ✔️ | . | ✔️ | . | ✔️ | . | ✔️ | ✔️ | ✔️ | . | . | ✔️ | . | . | . | . | ✔️ | ✔️ | . | . | ✔️ | . | . | ✔️ | ✔️ | ✔️ | . | . | ✔️ | . | . | ✔️ | . | -| [fast fourier transform](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/fast_fourier_transform/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [fast inverse sqrt](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/fast_inverse_sqrt/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [fermat primality test](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/primality_tests/fermat_primality_test/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [fermats little theorem](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/fermats_little_theorem/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [fibonacci number](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/fibonacci_number/) | . | . | ✔️ | ✔️ | ✔️ | . | ✔️ | . | ✔️ | . | ✔️ | . | ✔️ | ✔️ | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | ✔️ | ✔️ | ✔️ | . | . | ✔️ | . | . | ✔️ | . | -| [fractals](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/fractals/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [gaussian elimination](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/gaussian_elimination/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [gcd and lcm](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/gcd_and_lcm/) | . | . | ✔️ | ✔️ | . | . | ✔️ | . | ✔️ | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | ✔️ | . | . | . | . | . | ✔️ | . | -| [greatest digit in number](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/greatest_digit_in_number/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | ✔️ | ✔️ | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | -| [hill climbing](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/hill_climbing/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [horner polynomial evaluation](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/horner_polynomial_evaluation/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [integer conversion](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/integer_conversion/) | . | . | . | ✔️ | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [integer to roman](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/integer_to_roman/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [jacobi method](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/jacobi_method/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [karatsuba multiplication](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/karatsuba_multiplication/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [largrange polynomial](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/largrange_polynomial/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [lexicographic string rank](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/lexicographic_string_rank/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [log of factorial](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/log_of_factorial/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [lucas theorem](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/lucas_theorem/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [lucky number](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/lucky_number/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [magic square](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/magic_square/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [miller rabin primality test](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/primality_tests/miller_rabin_primality_test/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [modular inverse](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/modular_inverse/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | -| [multiply polynomial](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/multiply_polynomial/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [newman conway](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/newman_conway/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [newton polynomial](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/newton_polynomial/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [newton raphson method](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/newton_raphson_method/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [next larger number](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/next_larger_number/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [pandigital number](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/pandigital_number/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | -| [pascal triangle](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/pascal_triangle/) | . | . | ✔️ | ✔️ | . | . | ✔️ | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [perfect number](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/perfect_number/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | ✔️ | ✔️ | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | -| [permutation lexicographic order](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/permutation_lexicographic_order/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [poisson sample](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/poisson_sample/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [prime factors](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/prime_factors/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [prime numbers of n](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/prime_numbers_of_n/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [pythagorean triplet](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/pythagorean_triplet/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [replace 0 with 5](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/replace_0_with_5/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | -| [reverse factorial](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/reverse_factorial/) | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | . | . | -| [reverse number](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/reverse_number/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | ✔️ | ✔️ | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | ✔️ | . | . | ✔️ | . | -| [russian peasant multiplication](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/russian_peasant_multiplication/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | ✔️ | . | -| [scala](https://github.com/OpenGenus/cosmos/tree/master/code/design_pattern/src/functional_patterns/functional_patterns/scala/src/main/scala/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | -| [segmented sieve of eratosthenes](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/segmented_sieve_of_eratosthenes/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [shuffle array](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/shuffle_array/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | -| [sieve of atkin](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/sieve_of_atkin/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [sieve of eratosthenes](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/sieve_of_eratosthenes/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | ✔️ | ✔️ | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | -| [simpsons rule](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/simpsons_rule/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [smallest digit in number](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/smallest_digit_in_number/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | ✔️ | ✔️ | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | -| [solovay strassen primality test](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/primality_tests/solovay_strassen_primality_test/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [square free number](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/square_free_number/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [std](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/std/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [steepest descent](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/steepest_descent/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [structures](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/gaussian_elimination/scala/src/main/scala/structures/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | -| [sum of digits](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/sum_of_digits/) | . | . | ✔️ | ✔️ | . | . | ✔️ | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | ✔️ | . | . | ✔️ | . | -| [taxicab numbers](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/taxicab_numbers/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [tower of hanoi](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/tower_of_hanoi/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | ✔️ | ✔️ | ✔️ | . | . | . | . | ✔️ | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | -| [tribonacci numbers](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/tribonacci_numbers/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | -| [tridiagonal matrix](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/tridiagonal_matrix/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| | 0 | 0 | 48 | 61 | 2 | 0 | 5 | 0 | 3 | 0 | 27 | 0 | 10 | 46 | 29 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 15 | 1 | 0 | 0 | 48 | 0 | 0 | 19 | 11 | 10 | 0 | 0 | 7 | 0 | 0 | 16 | 0 | - - -# [NETWORKING](https://github.com/OpenGenus/cosmos/tree/master/code/networking) -| NETWORKING | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [determine endianess](https://github.com/OpenGenus/cosmos/tree/master/code/networking/src/determine_endianess/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [packetsniffer](https://github.com/OpenGenus/cosmos/tree/master/code/networking/src/packetsniffer/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [validate ip](https://github.com/OpenGenus/cosmos/tree/master/code/networking/src/validate_ip/) | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | -| | 0 | 0 | 2 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 2 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | - - -# [NUMERICAL ANALYSIS](https://github.com/OpenGenus/cosmos/tree/master/code/numerical_analysis) -| NUMERICAL ANALYSIS | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [src](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | - - -# [ONLINE CHALLENGES](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges) -| ONLINE CHALLENGES | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [3D aurface area](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/hackerrank/3D_aurface_area/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [CHDIGER](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/codechef/CHDIGER/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [CHNUM](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/codechef/CHNUM/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [JAIN](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/codechef/JAIN/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [NBONACCI](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/codechef/NBONACCI/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [almost sorted](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/hackerrank/almost_sorted/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [array manipulation](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/hackerrank/array_manipulation/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [bigger is greater](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/hackerrank/bigger_is_greater/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [complement dna strand](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/rosalind/complement_dna_strand/) | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | -| [encryption](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/hackerrank/encryption/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 001](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_001/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | -| [problem 002](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_002/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 003](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_003/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 004](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_004/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 005](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_005/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 006](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_006/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 007](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_007/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 008](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_008/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 009](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_009/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 010](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_010/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 012](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_012/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 013](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_013/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 014](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_014/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 016](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_016/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 018](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_018/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 019](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_019/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 020](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_020/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 021](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_021/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 022](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_022/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 024](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_024/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 025](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_025/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 026](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_026/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 028](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_028/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 034](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_034/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 036](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_036/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 037](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_037/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 040](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_040/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 067](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_067/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [problem 102](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/project_euler/problem_102/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [the maximum subarray](https://github.com/OpenGenus/cosmos/tree/master/code/online_challenges/src/hackerrank/the_maximum_subarray/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| | 0 | 0 | 4 | 29 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 8 | 4 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 23 | 0 | 0 | 0 | 2 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | - - -# [OPERATING SYSTEM](https://github.com/OpenGenus/cosmos/tree/master/code/operating_system) -| OPERATING SYSTEM | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [bankers algorithm](https://github.com/OpenGenus/cosmos/tree/master/code/operating_system/src/deadlocks/bankers_algorithm/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [c](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms/src/finite_automata/c/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [dining philosophers](https://github.com/OpenGenus/cosmos/tree/master/code/operating_system/src/concurrency/dining_philosophers/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [first come first serve](https://github.com/OpenGenus/cosmos/tree/master/code/operating_system/src/scheduling/first_come_first_serve/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | ✔️ | . | -| [least recently used](https://github.com/OpenGenus/cosmos/tree/master/code/operating_system/src/memory_management/least_recently_used/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [memory mapping](https://github.com/OpenGenus/cosmos/tree/master/code/operating_system/src/memory_management/memory_mapping/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [monitors system v](https://github.com/OpenGenus/cosmos/tree/master/code/operating_system/src/concurrency/monitors/monitors_system_v/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [multi level feedback queue scheduling](https://github.com/OpenGenus/cosmos/tree/master/code/operating_system/src/scheduling/multi_level_feedback_queue_scheduling/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | -| [peterson algorithm in c](https://github.com/OpenGenus/cosmos/tree/master/code/operating_system/src/concurrency/peterson_algorithm_for_mutual_exclusion/peterson_algorithm_in_c/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [processCreation](https://github.com/OpenGenus/cosmos/tree/master/code/operating_system/src/processCreation/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [producer consumer](https://github.com/OpenGenus/cosmos/tree/master/code/operating_system/src/concurrency/producer_consumer/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [readers writers](https://github.com/OpenGenus/cosmos/tree/master/code/operating_system/src/concurrency/readers_writers/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [round robin c](https://github.com/OpenGenus/cosmos/tree/master/code/operating_system/src/scheduling/round_robin_scheduling/round_robin_c/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [round robin scheduling](https://github.com/OpenGenus/cosmos/tree/master/code/operating_system/src/scheduling/round_robin_scheduling/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [shortest seek time first](https://github.com/OpenGenus/cosmos/tree/master/code/operating_system/src/scheduling/shortest_seek_time_first/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [smallest remaining time first](https://github.com/OpenGenus/cosmos/tree/master/code/operating_system/src/scheduling/smallest_remaining_time_first/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| | 0 | 0 | 10 | 6 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 2 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | - - -# [RANDOMIZED ALGORITHMS](https://github.com/OpenGenus/cosmos/tree/master/code/randomized_algorithms) -| RANDOMIZED ALGORITHMS | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [birthday paradox](https://github.com/OpenGenus/cosmos/tree/master/code/randomized_algorithms/src/birthday_paradox/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [karger minimum cut algorithm](https://github.com/OpenGenus/cosmos/tree/master/code/randomized_algorithms/src/karger_minimum_cut_algorithm/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [kth smallest element algorithm](https://github.com/OpenGenus/cosmos/tree/master/code/randomized_algorithms/src/kth_smallest_element_algorithm/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [random from stream](https://github.com/OpenGenus/cosmos/tree/master/code/randomized_algorithms/src/random_from_stream/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [randomized quick sort](https://github.com/OpenGenus/cosmos/tree/master/code/randomized_algorithms/src/randomized_quick_sort/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [reservoir sampling](https://github.com/OpenGenus/cosmos/tree/master/code/randomized_algorithms/src/reservoir_sampling/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | -| [shuffle an array](https://github.com/OpenGenus/cosmos/tree/master/code/randomized_algorithms/src/shuffle_an_array/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | -| | 0 | 0 | 2 | 6 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 2 | 0 | 0 | 1 | 2 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | - - -# [SEARCH](https://github.com/OpenGenus/cosmos/tree/master/code/search) -| SEARCH | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [binary search](https://github.com/OpenGenus/cosmos/tree/master/code/search/src/binary_search/) | . | . | ✔️ | ✔️ | . | . | ✔️ | . | . | . | ✔️ | . | ✔️ | ✔️ | ✔️ | . | . | ✔️ | . | . | . | . | ✔️ | . | . | . | ✔️ | ✔️ | . | ✔️ | ✔️ | ✔️ | ✔️ | . | ✔️ | . | . | ✔️ | . | -| [exponential search](https://github.com/OpenGenus/cosmos/tree/master/code/search/src/exponential_search/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | -| [fibonacci search](https://github.com/OpenGenus/cosmos/tree/master/code/search/src/fibonacci_search/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | . | -| [fuzzy search](https://github.com/OpenGenus/cosmos/tree/master/code/search/src/fuzzy_search/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [interpolation search](https://github.com/OpenGenus/cosmos/tree/master/code/search/src/interpolation_search/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [jump search](https://github.com/OpenGenus/cosmos/tree/master/code/search/src/jump_search/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | -| [linear search](https://github.com/OpenGenus/cosmos/tree/master/code/search/src/linear_search/) | . | . | ✔️ | ✔️ | ✔️ | . | . | . | . | . | ✔️ | . | ✔️ | ✔️ | ✔️ | . | . | ✔️ | . | ✔️ | ✔️ | . | ✔️ | . | . | . | ✔️ | . | ✔️ | ✔️ | ✔️ | ✔️ | . | . | ✔️ | . | . | ✔️ | . | -| [ternary search](https://github.com/OpenGenus/cosmos/tree/master/code/search/src/ternary_search/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | ✔️ | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | -| | 0 | 0 | 7 | 7 | 1 | 0 | 1 | 0 | 0 | 0 | 6 | 0 | 2 | 6 | 8 | 0 | 0 | 3 | 0 | 1 | 1 | 0 | 7 | 0 | 0 | 0 | 7 | 1 | 1 | 3 | 5 | 2 | 1 | 0 | 4 | 0 | 0 | 2 | 0 | - - -# [SELECTION ALGORITHMS](https://github.com/OpenGenus/cosmos/tree/master/code/selection_algorithms) -| SELECTION ALGORITHMS | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [median of medians](https://github.com/OpenGenus/cosmos/tree/master/code/selection_algorithms/src/median_of_medians/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [src](https://github.com/OpenGenus/cosmos/tree/master/code/artificial_intelligence/src/) | . | . | . | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | . | -| | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 2 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | - - -# [SORTING](https://github.com/OpenGenus/cosmos/tree/master/code/sorting) -| SORTING | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [bead sort](https://github.com/OpenGenus/cosmos/tree/master/code/sorting/src/bead_sort/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | -| [bogo sort](https://github.com/OpenGenus/cosmos/tree/master/code/sorting/src/bogo_sort/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | ✔️ | . | . | ✔️ | . | . | ✔️ | . | . | . | . | ✔️ | . | . | . | ✔️ | -| [bubble sort](https://github.com/OpenGenus/cosmos/tree/master/code/sorting/src/bubble_sort/) | . | . | ✔️ | ✔️ | . | . | ✔️ | ✔️ | . | ✔️ | ✔️ | . | ✔️ | ✔️ | ✔️ | ✔️ | . | ✔️ | . | . | . | ✔️ | ✔️ | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | ✔️ | ✔️ | ✔️ | ✔️ | . | ✔️ | . | -| [bucket sort](https://github.com/OpenGenus/cosmos/tree/master/code/sorting/src/bucket_sort/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | ✔️ | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | ✔️ | . | . | ✔️ | . | -| [circle sort](https://github.com/OpenGenus/cosmos/tree/master/code/sorting/src/circle_sort/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | -| [comb sort](https://github.com/OpenGenus/cosmos/tree/master/code/sorting/src/comb_sort/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | . | -| [counting sort](https://github.com/OpenGenus/cosmos/tree/master/code/sorting/src/counting_sort/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | -| [cycle sort](https://github.com/OpenGenus/cosmos/tree/master/code/sorting/src/cycle_sort/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | -| [flash sort](https://github.com/OpenGenus/cosmos/tree/master/code/sorting/src/flash_sort/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | -| [gnome sort](https://github.com/OpenGenus/cosmos/tree/master/code/sorting/src/gnome_sort/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | . | -| [heap sort](https://github.com/OpenGenus/cosmos/tree/master/code/sorting/src/heap_sort/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | ✔️ | . | . | ✔️ | . | . | ✔️ | . | -| [insertion sort](https://github.com/OpenGenus/cosmos/tree/master/code/sorting/src/insertion_sort/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | ✔️ | ✔️ | ✔️ | . | . | ✔️ | . | ✔️ | . | ✔️ | ✔️ | . | . | . | ✔️ | . | ✔️ | ✔️ | ✔️ | . | ✔️ | . | ✔️ | . | . | ✔️ | . | -| [intro sort](https://github.com/OpenGenus/cosmos/tree/master/code/sorting/src/intro_sort/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | -| [median sort](https://github.com/OpenGenus/cosmos/tree/master/code/sorting/src/median_sort/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | -| [merge sort](https://github.com/OpenGenus/cosmos/tree/master/code/sorting/src/merge_sort/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | ✔️ | ✔️ | ✔️ | . | . | ✔️ | . | . | . | ✔️ | ✔️ | ✔️ | . | . | ✔️ | . | . | ✔️ | ✔️ | ✔️ | ✔️ | . | ✔️ | ✔️ | . | ✔️ | ✔️ | -| [pigeonhole sort](https://github.com/OpenGenus/cosmos/tree/master/code/sorting/src/pigeonhole_sort/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | ✔️ | . | . | . | . | ✔️ | . | . | ✔️ | . | . | ✔️ | . | -| [quick sort](https://github.com/OpenGenus/cosmos/tree/master/code/divide_conquer/src/quick_sort/) | . | . | ✔️ | ✔️ | . | . | . | ✔️ | . | . | ✔️ | . | ✔️ | ✔️ | ✔️ | . | . | . | ✔️ | ✔️ | . | ✔️ | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | ✔️ | ✔️ | . | ✔️ | ✔️ | . | ✔️ | . | -| [radix sort](https://github.com/OpenGenus/cosmos/tree/master/code/sorting/src/radix_sort/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | ✔️ | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | -| [selection sort](https://github.com/OpenGenus/cosmos/tree/master/code/sorting/src/selection_sort/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | ✔️ | ✔️ | ✔️ | . | . | ✔️ | . | . | . | ✔️ | ✔️ | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | ✔️ | . | ✔️ | . | ✔️ | ✔️ | . | -| [shaker sort](https://github.com/OpenGenus/cosmos/tree/master/code/sorting/src/shaker_sort/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | ✔️ | . | . | ✔️ | . | -| [shell sort](https://github.com/OpenGenus/cosmos/tree/master/code/sorting/src/shell_sort/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | . | -| [sleep sort](https://github.com/OpenGenus/cosmos/tree/master/code/sorting/src/sleep_sort/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | ✔️ | . | . | . | . | . | ✔️ | ✔️ | . | . | . | ✔️ | . | . | ✔️ | . | ✔️ | ✔️ | . | ✔️ | . | . | ✔️ | . | -| [stooge sort](https://github.com/OpenGenus/cosmos/tree/master/code/sorting/src/stooge_sort/) | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [topological sort](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src/topological_sort/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [tree sort](https://github.com/OpenGenus/cosmos/tree/master/code/sorting/src/tree_sort/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| | 0 | 0 | 23 | 23 | 0 | 0 | 1 | 2 | 0 | 1 | 19 | 0 | 7 | 22 | 22 | 2 | 0 | 5 | 1 | 2 | 0 | 21 | 9 | 2 | 0 | 0 | 23 | 0 | 1 | 9 | 8 | 5 | 6 | 1 | 21 | 3 | 1 | 15 | 2 | - - -# [SQUARE ROOT DECOMPOSITION](https://github.com/OpenGenus/cosmos/tree/master/code/square_root_decomposition) -| SQUARE ROOT DECOMPOSITION | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [mos algorithm](https://github.com/OpenGenus/cosmos/tree/master/code/square_root_decomposition/src/mos_algorithm/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | - - -# [STRING ALGORITHMS](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms) -| STRING ALGORITHMS | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [aho corasick algorithm](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms/src/aho_corasick_algorithm/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [anagram search](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms/src/anagram_search/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | ✔️ | . | . | ✔️ | . | . | ✔️ | . | -| [arithmetic on large numbers](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms/src/arithmetic_on_large_numbers/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [boyer moore algorithm](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms/src/boyer_moore_algorithm/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [c](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms/src/finite_automata/c/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [finite automata](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms/src/finite_automata/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | -| [kasai algorithm](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms/src/kasai_algorithm/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [kmp algorithm](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms/src/kmp_algorithm/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [levenshtein distance](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms/src/levenshtein_distance/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [lipogram checker](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms/src/lipogram_checker/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | -| [longest palindromic substring](https://github.com/OpenGenus/cosmos/tree/master/code/dynamic_programming/src/longest_palindromic_substring/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [manachar algorithm](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms/src/manachar_algorithm/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [morse code](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms/src/morse_code/) | . | . | . | ✔️ | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [naive pattern search](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms/src/naive_pattern_search/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [palindrome checker](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms/src/palindrome_checker/) | . | . | ✔️ | ✔️ | ✔️ | ✔️ | ✔️ | . | ✔️ | . | ✔️ | . | ✔️ | ✔️ | ✔️ | . | . | ✔️ | ✔️ | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | ✔️ | ✔️ | . | ✔️ | . | ✔️ | . | . | ✔️ | . | -| [palindrome substring](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms/src/palindrome_substring/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [pangram checker](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms/src/pangram_checker/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | ✔️ | . | . | . | . | -| [password strength checker](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms/src/password_strength_checker/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | -| [rabin karp algorithm](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms/src/rabin_karp_algorithm/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [remove dups](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms/src/remove_dups/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | . | -| [suffix array](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms/src/suffix_array/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [trie pattern search](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms/src/trie_pattern_search/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [z algorithm](https://github.com/OpenGenus/cosmos/tree/master/code/string_algorithms/src/z_algorithm/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| | 0 | 0 | 8 | 15 | 1 | 1 | 1 | 0 | 1 | 0 | 4 | 0 | 1 | 9 | 7 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 3 | 0 | 0 | 1 | 13 | 0 | 0 | 3 | 3 | 1 | 1 | 0 | 3 | 0 | 0 | 4 | 0 | - - -# [THEORY OF COMPUTATION](https://github.com/OpenGenus/cosmos/tree/master/code/theory_of_computation) -| THEORY OF COMPUTATION | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [deterministic finite automaton](https://github.com/OpenGenus/cosmos/tree/master/code/theory_of_computation/src/deterministic_finite_automaton/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [nondeterministic finite atomaton](https://github.com/OpenGenus/cosmos/tree/master/code/theory_of_computation/src/nondeterministic_finite_atomaton/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 2 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | - - -# [UNCLASSIFIED](https://github.com/OpenGenus/cosmos/tree/master/code/unclassified) -| UNCLASSIFIED | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [average](https://github.com/OpenGenus/cosmos/tree/master/code/unclassified/src/average/) | . | . | ✔️ | ✔️ | . | . | ✔️ | . | ✔️ | . | ✔️ | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | ✔️ | ✔️ | ✔️ | ✔️ | . | ✔️ | . | . | ✔️ | . | -| [biggest of n numbers](https://github.com/OpenGenus/cosmos/tree/master/code/unclassified/src/biggest_of_n_numbers/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | -| [biggest suffix](https://github.com/OpenGenus/cosmos/tree/master/code/unclassified/src/biggest_suffix/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [fifteen puzzle](https://github.com/OpenGenus/cosmos/tree/master/code/unclassified/src/fifteen_puzzle/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [jaccard similarity](https://github.com/OpenGenus/cosmos/tree/master/code/unclassified/src/jaccard_similarity/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [josephus problem](https://github.com/OpenGenus/cosmos/tree/master/code/unclassified/src/josephus_problem/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [lapindrom checker](https://github.com/OpenGenus/cosmos/tree/master/code/unclassified/src/lapindrom_checker/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [leap year](https://github.com/OpenGenus/cosmos/tree/master/code/unclassified/src/leap_year/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | ✔️ | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | ✔️ | . | -| [magic square](https://github.com/OpenGenus/cosmos/tree/master/code/mathematical_algorithms/src/magic_square/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | . | . | . | -| [majority element](https://github.com/OpenGenus/cosmos/tree/master/code/unclassified/src/majority_element/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [minimum subarray size with degree](https://github.com/OpenGenus/cosmos/tree/master/code/unclassified/src/minimum_subarray_size_with_degree/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [no operator addition](https://github.com/OpenGenus/cosmos/tree/master/code/unclassified/src/no_operator_addition/) | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [optimized fibonacci](https://github.com/OpenGenus/cosmos/tree/master/code/unclassified/src/optimized_fibonacci/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [paint fill](https://github.com/OpenGenus/cosmos/tree/master/code/unclassified/src/paint_fill/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [smallest number to the left](https://github.com/OpenGenus/cosmos/tree/master/code/unclassified/src/smallest_number_to_the_left/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [spiral print](https://github.com/OpenGenus/cosmos/tree/master/code/unclassified/src/spiral_print/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [split list](https://github.com/OpenGenus/cosmos/tree/master/code/unclassified/src/split_list/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | -| [tokenizer](https://github.com/OpenGenus/cosmos/tree/master/code/unclassified/src/tokenizer/) | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [unique number](https://github.com/OpenGenus/cosmos/tree/master/code/unclassified/src/unique_number/) | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | -| [utilities](https://github.com/OpenGenus/cosmos/tree/master/code/unclassified/src/utilities/) | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | . | ✔️ | . | . | . | . | . | . | -| | 0 | 0 | 10 | 12 | 0 | 0 | 1 | 0 | 1 | 0 | 4 | 0 | 0 | 5 | 3 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 2 | 0 | 0 | 0 | 9 | 0 | 0 | 1 | 2 | 1 | 2 | 0 | 2 | 0 | 0 | 3 | 0 | - - -# [UTILITY](https://github.com/OpenGenus/cosmos/tree/master/code/utility) -| UTILITY | Ada | BrainFuck | C | C++ | Clojure | Crisp | Elixir | Elm | Erlang | Fortran | Golang | HTML | Haskell | Java | JavaScript | Julia | Jupyter Notebook | Kotlin | Lua | ML | Nim | Objective-C | PHP | Perl | Processing Development Environment | PureScript | Python | Racket | Reason | Ruby | Rust | Scala | Shell Script | Standard ML | Swift | TypeScript | Visual Basic | Visual C# | Visual F# | -| ----------------------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | -| [palindrome check](https://github.com/OpenGenus/cosmos/tree/master/code/utility/src/palindrome/palindrome_check/) | . | . | ✔️ | ✔️ | . | . | . | . | . | . | . | . | . | ✔️ | ✔️ | . | . | . | . | . | ✔️ | . | . | . | . | . | ✔️ | . | . | ✔️ | . | . | . | . | . | . | . | ✔️ | . | - - -| TOTALS | 1 | 1 | 247 | 378 | 4 | 1 | 13 | 2 | 6 | 1 | 109 | 2 | 37 | 244 | 121 | 4 | 6 | 16 | 3 | 4 | 3 | 23 | 48 | 4 | 1 | 1 | 309 | 1 | 2 | 59 | 50 | 41 | 16 | 2 | 61 | 5 | 1 | 60 | 3 | -| ------ | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | ----------------------------------- | diff --git a/build/lib/data/stats.txt b/build/lib/data/stats.txt deleted file mode 100755 index 1b6306b..0000000 --- a/build/lib/data/stats.txt +++ /dev/null @@ -1,772 +0,0 @@ -This is the progress list of Cosmos | Updated on: 2019-06-08 - - -ARTIFICIAL INTELLIGENCE Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -a star . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -artificial neural network . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -autoenncoder . . . . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . -canny . . x x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -convolutional neural network . . . . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . -dbscan clustering . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -decision tree . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -erode dilate . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -factorization machines . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -gaussian naive bayes . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -gbestPSO . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -hierachical clustering . . . x . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . -houghtransform . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -image processing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . -image stitching . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -isodata clustering . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -k means . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . x . . . . -k nearest neighbours . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -lbestPSO . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -linear regression . . . . . . . . . . . . . x x . . . . . . . . . . . x . . . . . . . x . . . . -logistic regression . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -minimax . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -naive bayes . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . x . . . . -neural network . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -neural style transfer . . . . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . -nsm matlab . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . -perceptron . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -prewittfilter . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -principal component analysis . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -q learning . . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . -restricted boltzmann machine . . . . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . -sat . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -sobelfilter . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -src . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -support vector machine . . x . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -tsp . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 3 10 0 0 0 0 0 0 0 0 0 1 2 0 5 0 0 0 0 1 0 0 0 0 19 0 0 0 0 0 1 0 3 0 0 0 0 - - -BACKTRACKING Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -algorithm x . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -crossword puzzle . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -knight tour . . x x . . . . . . x . . x . . . . . . . . . . . . x . . . x . . . . . . . . -m coloring problem . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -n queen . . x x . . . . . . x . x x . . . . . . . . . . . . x . . . x . . . . . . . . -number of ways in maze . . x x . . . . . . x . . x . . . . . . . . . . . . . . . . x . . . . . . . . -partitions of number . . . x . . . . . . x . . . . . . . . . . . . . . . . . . . x . . . . . . . . -partitions of set . . . x . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . -permutations of string . . x x . . . . . . x . . . . . . x . . . . . . . . x . . . . . . . . . . . . -powerset . . x . . . . . . . x . . x . . . . . . . . . . . . . . . . . . . . . . . . . -rat in a maze . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -subset sum . . x x . . . . . . x . . x . . . . . . . . . . . . x . . . . . . . . . . . . -sudoku solve . . x x . . . . . . . . . . . . . . . . . . . . . . x . . . x . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 7 10 0 0 0 0 0 0 8 0 1 6 0 0 0 1 0 0 0 0 0 0 0 0 6 0 0 0 5 0 0 0 0 0 0 0 0 - - -BIT MANIPULATION Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -addition using bits . . . x . . . . . . . . . . x . . . . . . . . . . . x . . . . . . . . . . x . -bit division . . x . . . . . . . x . . x x . . . . . . . . . . . x . . . . . . . . . . . . -byte swapper . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -convert number binary . . x x . . . . . . . . x x x . . . . . . . x . . . x . . . . . . . . . . . . -count set bits . . x x . . . . . . . . . x x . . . . . . . . . . . x . . . . . . . . . . x . -flip bits . . x x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -hamming distance . . x x . . . . . . x . . x . . . . . . . . . . . . x . . . . . . . . . . . . -invert bit . . x x . . . . . . . . . . x . . . . . . . . . . . x . . . . . . . . . . . . -lonely integer . . x x . . . . . . x . . x x . . . . . . . . . . . x . . . x . . . . . . . . -magic number . . x x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -maximum xor value . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -power of 2 . . x x . . . . . . x . . x x x . . . . . . . . . . x . . . x . . . . . . x . -subset generation . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -sum binary numbers . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -sum equals xor . . x x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -thrice unique number . . . x . . . . . . . . . x x . . . . . . . . . . . x . . . . . . . . . . . . -twice unique number . . x x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -xor swap . . x x . . . . . . x . . . . . . . . . . . . . . . x . . . . . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 13 15 0 0 0 0 0 0 5 0 1 10 8 1 0 0 0 0 0 0 1 0 0 0 13 0 0 0 2 0 0 0 0 0 0 3 0 - - -CELLULAR AUTOMATON Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -conways game of life . . x x . . . . . . x . x x . . . . . . . . . . . . x . . x . . . . . . . . . -elementary cellular automata . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -genetic algorithm . . . x . . . . . . x . . x x . . . . . . . . . . . x . . . . . . . . . . . . -langtons ant . . . x . . . . . . . x . x . . . . . . . . . . . . x . . . . . . . . . . . . -von neumann cellular automata . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 2 3 0 0 0 0 0 0 2 1 1 4 1 0 0 0 0 0 0 0 0 0 0 0 3 0 0 1 0 0 0 0 0 0 0 0 0 - - -COMPRESSION Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -huffman . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -lempel ziv welch . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 - - -COMPUTATIONAL GEOMETRY Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -2d line intersection . . x x . . . . . . . . x x x . . . . . . . . . . . x . . x . . . . . . . x . -2d separating axis test . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -area of polygon . . x x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -area of triangle . . x x . . . . . . x . . x x . . . . . . . . . . . x . . . x . . . . . . . . -axis aligned bounding box collision . . . x . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . -bresenham circle . . x x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -bresenham line . . . x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -chans algorithm . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -cohen sutherland lineclip . . x x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -dda line . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -distance between points . . x x . . . . . . x . . x x . . . . . . . . . . . x . . . x . . . . . . . . -graham scan . . . x . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -halfplane intersection . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -jarvis march . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -liangBarskyAlgo . . x x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -quickhull . . . x . . . . . . . . x x . . . . . . . . . . . . . . . . . . . . . . . . . -sphere tetrahedron intersection . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -sutherland hodgeman clipping . . x x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 8 18 0 0 0 0 0 0 3 0 2 7 3 0 0 0 0 0 0 0 0 0 0 0 6 0 0 1 2 0 0 0 0 0 0 1 0 - - -COMPUTER GRAPHICS Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -diamond square . . . . . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 - - -CRYPTOGRAPHY Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -aes 128 . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -aes csharp . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x . -affine cipher . . . x . . . . . . . x . x . . . x . . . . . . . . x . . . . . . . . . . . . -atbash cipher . . . x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -autokey cipher . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -baconian cipher . . x x . . . . . . . . . x x . . . . . . . x . . . x . . x . . . . . . . . . -caesar cipher . . x x . . . . . . x . x x x . . . . . . . x . . . x . . x . . . . . . . x . -columnar transposition cipher . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -example . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x . -huffman encoding . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -morse cipher . x x x . . . . . . . . . x x . . . x . . . x . . . x . . x . . x . . x . . . -polybius cipher . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -porta cipher . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -rail fence cipher . . . x . . . . . . . . . . . . . . . . . . . . . . x . . x . . . . . . . . . -rot13 cipher . . x x . . . . . . . . . x x . . . . . . . . . . . x . . x . . x . . . . . . -rsa . . x . . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . x . -rsa digital signature . . . . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . -runningkey cipher . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -sha 256 . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -vigenere cipher . . x x . . . . . . x . x x x x . . . . . . x . . . x . . x . . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 1 7 10 0 0 0 0 0 0 2 1 2 8 5 1 1 1 1 0 0 0 4 0 0 0 15 0 0 6 0 0 2 0 0 1 0 4 0 - - -DATA STRUCTURES Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -aa tree . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -abstract stack . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -arraystack . . x x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -avl tree . . x x . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . x . . . . -b tree . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . x . . . . -b tree c . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -bag . . . . . . . . . . . . . x x . . . . . . . . . . . x . . . . . . . . . . . . -balanced expression . . x x . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -binary heap . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -binomial heap . . x x . . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . -bloom filter . . x x . . . . . . x . . x x . . . . . . . . . . . x . . . . x . . x . . . . -bottom view binary tree . . . x . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -c . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -circular buffer . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -circular linked list . . x x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -convert to doubly linked list . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -cpp . . x . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -delete . . x . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -detect cycle . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -diameter . . x x . . . . . . . . x x . . . . . . . . . . . . x . . . . . . . . . . . . -double ended queue . . x x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -doubly linked list . . . x . . . . . . x . . x x . . . . . . . . . . . x . . . . . . . x . . . . -fenwick tree . . x x . . . . . . x . . x . . . . . . . . . x . . x . . . . . . . . . . . . -find . . x . . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -from inorder and postorder . . x x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -from inorder and preorder . . x x . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -hash table . . x x . . . . . . x . . x x . . . . . . . . . . . x . . . x . . . x . . x . -infix to postfix . . x x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -infix to prefix . . . x . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -insertion . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -interval tree . . . x . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -is balance . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -is binary tree . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -is same . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -kd tree . . . x . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -left view . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -leftist tree . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -linked list . . x x . . . . . . . . . x x . . . . . . . . . . . x . . . . . . . . . . . . -make mirror tree . . x x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -max heap . . x x . . . . . . x . . x . . . . . . . . . . . . x . . . . . . . . . . . . -maximum height . . . x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -menu interface . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -merge sorted . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -min heap . . x x . . . . . . . . . x x . . . . . . . . . . . x . . x . . . . x . . . . -minimum height . . x x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -n th node linked list . . x x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -node . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -operations . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -pairing heap . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . x -path sum . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -postfix evaluation . . x . . . . . . . . . . . . . . . . . . . . . . . x . . . . . x . . . . . . -prefix to postfix . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -print reverse . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . x . . . . . . . -priority queue . . . . . . . . . . . . . . x . . . . . . . . . . . x . . . . . . . . . . . . -push . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -quad tree . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . -queue . . x x . . x . . . x . . x x . . . . . . . . . . . x . . x . . . . x . . x . -queue stream . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x . -queue using linked list . . x x . . . . . . . . . x . . . . . . . . . . . . x . . x . . . . . . . . . -queue using stack . . x x . . . . . . . . . x . . . . . . . . . . . . x . . . . . x . . . . . . -red black tree . . x x . . . . . . . . . x . . . . . . . . . . . . . . . x . x . . . . . . . -reverse . . x x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -reverse queue . . . x . . . . . . x . . x . . . . . . . . . . . . x . . . . . . . x . . . . -reverse stack . . x x . . . . . . x . . x . . . . . . . . . . . . x . . . . . . . x . . x . -right threaded . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -right view . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -rope . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -rotate . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -segment tree x . . x . . . . . . x . . x . . . . . . . . . . . . x . . x . x . . . . . . . -serializer . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -singly linked list . . x x . . . . . . x . . x x . . . . . . . . . . . x . . x . . . . x . . x . -skip list . . x x . . . . . . . . . x . . . . . . . . . . . . . . . x . x . . x . . . . -soft heap . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -sort . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -sort stack . . x x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -splay tree . . . x . . . . . . x . . x . . . x . . . . . . . . . . . . . x . . . . . . . -stack . . x x . . x . x . x . . x x . . . . . . . x . . . x . . x x . . . x . . x . -suffix array . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -sum left . . x . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -treap . . . x . . . . . . . . . x . . . x . . . . . . . . . . . . . x . . x . . . . -tree . . x x . . . . . . x . . x x . . . . . . . . . . . x . . x . . . . x . . . . -trie . . x x . . . . . . x . . x x . . . . . . . . . . . x . . x . x . . x . . x . -two three tree . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . -unclassified . . x x . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -union find . . x x . . . . . . x . . x x . . . . . . . . . . . x . . . . x . . . . . . . -van emde boas tree . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -xor linked list . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -zigzag . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 1 0 42 66 0 0 2 0 1 0 15 0 1 41 13 0 0 2 0 0 0 0 1 1 0 0 40 0 0 10 2 11 2 1 16 0 0 7 1 - - -DESIGN PATTERN Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -OOP patterns . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -adapter . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -arrow . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . -bifunctor . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . -builder . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -builder pattern . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x . -comonad . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . -contravariant . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . -demo . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -facade . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -factory . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -functor . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . -gifts . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -gonad . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . -gym . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -iterator pattern . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -job . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -monad . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . -multifunctor . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . -network . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -observer . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -observer java . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -observer pattern . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . x . . . . . . . . -policy based design . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -profunctor . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . -proxy . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -routine . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -scala . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . -singleton pattern . . . x . . . . . . . . . x . . . . . . . . x . . . x . . . . . . . . . . x . -soldiers . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -src . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -tasks . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 0 3 0 0 0 0 0 0 0 0 0 17 0 0 0 0 0 0 0 0 1 0 0 0 4 0 0 0 1 10 0 0 0 0 0 2 0 - - -DIVIDE CONQUER Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -closest pair of points . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -factorial . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -inversion count . . x x . . . . . . . . . x x . . . . . . . . . . . x . . . . . . . . . . . . -karatsuba multiplication . . . x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -maximum contiguous subsequence sum . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -merge sort using divide and conquer . . x x . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -quick sort . . x x . . . . . . . . x x . . . . . . . . . . . . x . . . x . . . x . . . . -strassen matrix multiplication . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -tournament method to find min max . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -warnock algorithm . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . . . -x power y . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 6 6 0 0 0 0 0 0 0 0 1 4 1 0 0 0 0 0 0 0 0 0 1 0 6 0 0 0 1 0 0 0 1 0 0 0 0 - - -DYNAMIC PROGRAMMING Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -array median . . x x . . . . . . . . . x . . . . . . . . x . . . x . . x x . . . . . . . . -binomial coefficient . . x x . . . . . . . . . x x . . . . . . . . . . . x . . . . . . . . . . . . -boolean parenthesization . . x x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . x . . . . -box stacking . . . x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -coin change . . x x . . . . . . x . . x . . . . . . . . . . . . x . . . . . . . . . . . . -digit dp . . . x . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -edit distance . . x x . . . . . . x . x x . . . . . . . . x . . . x . . . x . . . . . . . . -egg dropping puzzle . . x x . . . . . . . . x x . . . . . . . . . . . . x . . . . . . . . . . . . -factorial . . x . . . x . . . x . . x x . . . . . . . . . . . x . . . x x . . . . . . . -fibonacci . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -knapsack . . x x . . . . . . x . . x x . . . . . . . . . . . x . . . . . . . . . . . . -largest sum contiguous subarray . . x x . . . . . . x . x x . . . . . . . . . . . . x . . . . . . . . . . . . -longest bitonic sequence . . x x . . . . . . . . . x x . . . . . . . . . . . x . . . . . . . . . . . . -longest common increasing subsequence . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -longest common subsequence . . . x . . . . . . x . . x . . . . . . . . . . . . x . . . . . . . . . . . . -longest common substring . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -longest increasing subsequence . . x x . . . . . . x . . x x . . . . . . . . . . . x . . . . . . . . . . . . -longest palindromic sequence . . x x . . . . . . . . . . x . . . . . . . . . . . x . . . . . . . . . . . . -longest palindromic substring . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -longest repeating subsequence . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -matrix chain multiplication . . x x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -maximum sum increasing subsequence . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -maximum sum sub matrix . . . x . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -maximum weight independent set of path graph . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -min cost path . . x x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -minimum insertion palindrome . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -no consec ones . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -numeric keypad problem . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -optimal binary search tree . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -palindrome partition . . . x . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . -rod cutting . . x x . . . . . . x . x . . . . . . . . . . . . . x . . . . . . . . . . . . -shortest common supersequence . . . x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -subset sum . . . x . . . . . . x . . x . . . . . . . . . . . . x . . . . . . . . . . . . -tiling problem . . x x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -weighted job scheduling . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 17 31 0 0 1 0 0 0 9 0 4 19 7 0 0 0 0 0 0 0 2 0 0 0 24 0 0 1 3 1 0 0 1 0 0 0 0 - - -FILTERS Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -gaussian filter . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -median filter . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 - - -GAME THEORY Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -game of nim next best move . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -game of nim win loss prediction . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -grundy numbers kayle . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 0 0 0 0 0 - - -GRAPH ALGORITHMS Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -adjacency lists in c . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -adjacency matrix c . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -astar algorithm . . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . -bellman ford algorithm . . x x . . . . . . . . . x x . . . . . . . x . . . x . . . . . . . . . . . . -biconnected components . . . x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -bipartite check . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -bipartite checking . . . x . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -boruvka minimum spanning tree . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -breadth first search . . x x . . . . . . . . . x . . . . . . . . . . . . x . . x . . . . x . . . . -bridge tree . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -bridges in graph . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -bron kerbosch algorithm . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -centroid decomposition . . . x . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -connected components . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -count of ways n . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -cut vertices . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -cycle directed graph . . x x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -cycle undirected graph . . . x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -data structures . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -depth first search . . x x . . . . . . x . . x . . . x . . . . . . . . x . . x . . . . . . . . . -dijkstra shortest path . . x x . . . . . . . . . x x . . . . . . . . . . . x . . . . . . . . . . . . -dinic maximum flow . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -eulerian path . . . . . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -floyd warshall algorithm . . x x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -ford fulkerson maximum flow . . . x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -graph coloring . . . x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -hamiltonian cycle . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -hamiltonian path . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -johnson algorithm shortest path . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -karger minimum cut . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -kruskal minimum spanning tree . . x x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -kuhn maximum matching . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -kuhn munkres algorithm . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -left view binary tree . . . x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -longest path directed acyclic graph . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -matrix transformation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . -maximum bipartite matching . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -postorder from inorder and preorder . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -prim minimum spanning tree . . x x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -push relabel . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -steiner tree . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -strongly connected components . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -tarjan algorithm strongly connected components . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -topological sort . . x x . . . . . . . . x x x . . . . . . . . . . . x . . . . . . . . . . . . -transitive closure graph . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -travelling salesman mst . . x x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 14 32 0 0 0 0 0 0 1 0 1 19 4 0 0 1 0 0 0 0 1 0 0 0 21 0 0 2 0 0 0 0 2 0 0 0 0 - - -GREEDY ALGORITHMS Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -activity selection . . x x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -dijkstra shortest path . . x x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -egyptian fraction . . x x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -fractional knapsack . . x x . . . . . . x . . x . . . . . . . . . . . . x . . . . . . . . . . x . -hillclimber . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -huffman coding . . x x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -job sequencing . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -k centers . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -kruskal minimum spanning tree . . x x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -minimum coins . . x x . . . . . . x . x x x . . . . . . . . . . . x . . . . . . . . . . . . -prim minimum spanning tree . . x x . . . . . . . . x . . . . . . . . . . . . . x . . . . . . . . . . . . -warshall . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 9 9 0 0 0 0 0 0 2 0 2 5 1 0 0 0 0 0 0 0 0 0 0 0 10 0 0 0 0 0 0 0 0 0 0 1 0 - - -LANGUAGE Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -loop . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 - - -LANGUAGES Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -dynamic memory allocation . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -tuple . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 - - -MATHEMATICAL ALGORITHMS Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -2sum . . x x . . . . . . x . . x x . . . . . . . . . . . x . . x x . . . . . . . . -add polynomials . . x x . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . -amicable numbers . . x x . . . . . . x . . x x . . . . . . . . . . . x . . x x . . . . . . x . -armstrong numbers . . x x . . . . . . x . . x x . . . . . . . x . . . x . . x . . . . . . . x . -automorphic numbers . . x x . . . . . . x . x x x . . . . . . . x . . . x . . x . . . . x . . x . -average stream numbers . . x x . . . . . . x . . . . . . . . . . . . . . . x . . . . . . . . . . . . -babylonian method . . x x . . . . . . x . . x x . . . . . . . . . . . x . . . . . . . . . . . . -binomial coefficient . . x x . . . . . . x . . x . . . . . . . . . . . . x . . . . . . . . . . . . -catalan number . . x x . . . . . . . . . x x . . . . . . . . . . . x . . x . x . . . . . . . -check is square . . x x . . . . . . x . . x x . . . . . . . x . . . x . . x x x . . x . . x . -collatz conjecture sequence . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -convolution . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -coprime numbers . . x x . . . . . . x . . x x . . . . . . . . . . . x . . x x . . . . . . x . -count digits . . x x . . . . . . x . x x x . . . . . . . . . . . x . . x . . . . x . . x . -count trailing zeroes . . x x . . . . . . . . . x x . . . . . . . . . . . x . . . . x . . . . . . . -delannoy number . . x x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -derangements . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -diophantine . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -divided differences . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -elimination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . -euler totient . . x x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -exponentiation by squaring . . x x . . . . . . x . . . . . . . . . . . . . . . x . . . . . . . . . . . . -exponentiation power . . x x . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -factorial . . x x x . x . x . x . x x x . . x . . . . x x . . x . . x x x . . x . . x . -fast fourier transform . . x . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -fast inverse sqrt . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -fermat primality test . . x . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -fermats little theorem . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -fibonacci number . . x x x . x . x . x . x x x . . . . . . . x . . . x . . x x x . . x . . x . -fractals . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -gaussian elimination . . . x . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -gcd and lcm . . x x . . x . x . x . . x x . . . . . . . x . . . x . . . . x . . . . . x . -greatest digit in number . . x x . . . . . . . . x x x . . . . . . . x . . . x . . x . . . . . . . x . -hill climbing . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -horner polynomial evaluation . . . x . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -integer conversion . . . x . . . . . . x . . . x . . . . . . . . . . . x . . . . . . . . . . . . -integer to roman . . . x . . . . . . . . . . x . . . . . . . . . . . x . . . . . . . . . . . . -jacobi method . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -karatsuba multiplication . . . x . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -largrange polynomial . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -lexicographic string rank . . x x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -log of factorial . . x x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -lucas theorem . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -lucky number . . x . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -magic square . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -miller rabin primality test . . . x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -modular inverse . . . x . . . . . . . . . x . . . . . . . . . . . . x . . x . . . . . . . . . -multiply polynomial . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -newman conway . . x x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -newton polynomial . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -newton raphson method . . x x . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . -next larger number . . . x . . . . . . . . . x . . . . . . . . x . . . x . . . . . . . . . . . . -pandigital number . . x . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . -pascal triangle . . x x . . x . . . x . . x . . . . . . . . . . . . x . . . . . . . . . . . . -perfect number . . x x . . . . . . . . x x x . . . . . . . x . . . x . . x x . . . . . . . . -permutation lexicographic order . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -poisson sample . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -prime factors . . x x . . . . . . x . . x . . . . . . . . . . . . x . . . . . . . . . . . . -prime numbers of n . . x x . . . . . . . . . . x . . . . . . . . . . . x . . . . . . . . . . . . -pythagorean triplet . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -replace 0 with 5 . . x x . . . . . . x . . x x . . . . . . . . . . . x . . . . . . . . . . x . -reverse factorial . . x . . . . . . . x . . x x . . . . . . . . . . . x . . x . . . . . . . . . -reverse number . . x x . . . . . . x . x x x . . . . . . . x . . . x . . x . . . . x . . x . -russian peasant multiplication . . x x . . . . . . x . . . x . . . . . . . x . . . x . . . x . . . . . . x . -scala . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . -segmented sieve of eratosthenes . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -shuffle array . . x x . . . . . . . . . . x . . . . . . . . . . . . . . x . . . . . . . . . -sieve of atkin . . x x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -sieve of eratosthenes . . x x . . . . . . x . x x x . . . . . . . x . . . x . . . . . . . . . . x . -simpsons rule . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -smallest digit in number . . x x . . . . . . . . x x x . . . . . . . x . . . x . . x . . . . . . . x . -solovay strassen primality test . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -square free number . . x x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -std . . x x . . . . . . x . . . x . . . . . . . . . . . x . . . . . . . . . . . . -steepest descent . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -structures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . -sum of digits . . x x . . x . . . x . . x x . . . . . . . x . . . x . . x x . . . x . . x . -taxicab numbers . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -tower of hanoi . . x x . . . . . . x . x x x . . . . x . . . . . . x . . . x x . . . . . . . -tribonacci numbers . . x x . . . . . . x . . x x . . . . . . . . . . . x . . . x . . . . . . . . -tridiagonal matrix . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 48 61 2 0 5 0 3 0 27 0 10 46 29 0 0 1 0 1 0 0 15 1 0 0 48 0 0 19 11 10 0 0 7 0 0 16 0 - - -NETWORKING Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -determine endianess . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -packetsniffer . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -validate ip . . x . . . . . . . x . . . x . . . . . . . x . . . x . . x . . x . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 2 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 2 0 0 1 0 0 1 0 0 0 0 0 0 - - -NUMERICAL ANALYSIS Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -src . . x x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 1 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 - - -ONLINE CHALLENGES Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -3D aurface area . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -CHDIGER . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -CHNUM . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -JAIN . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -NBONACCI . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -almost sorted . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -array manipulation . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -bigger is greater . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -complement dna strand . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . -encryption . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -problem 001 . . x x . . . . . . . . . x x . . . . . . . . . . . x . . . x . . . . . . . . -problem 002 . . x x . . . . . . . . . x x . . . . . . . . . . . x . . . . . . . . . . . . -problem 003 . . x x . . . . . . . . . x x . . . . . . . . . . . x . . . . . . . . . . . . -problem 004 . . . x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -problem 005 . . x x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -problem 006 . . . x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -problem 007 . . . x . . . . . . . . . . x . . . . . . . . . . . x . . . . . . . . . . . . -problem 008 . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -problem 009 . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -problem 010 . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -problem 012 . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -problem 013 . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -problem 014 . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -problem 016 . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -problem 018 . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -problem 019 . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -problem 020 . . . . . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -problem 021 . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -problem 022 . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -problem 024 . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -problem 025 . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -problem 026 . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -problem 028 . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -problem 034 . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -problem 036 . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -problem 037 . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -problem 040 . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -problem 067 . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -problem 102 . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -the maximum subarray . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 4 29 0 0 1 0 0 0 0 0 0 8 4 0 0 0 0 0 0 0 0 0 0 0 23 0 0 0 2 0 0 0 0 0 0 0 0 - - -OPERATING SYSTEM Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -bankers algorithm . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -c . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -dining philosophers . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -first come first serve . . . x . . . . . . . . . x . . . . . . . . . . . . x . . . x . . . . . . x . -least recently used . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -memory mapping . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -monitors system v . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -multi level feedback queue scheduling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . -peterson algorithm in c . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -processCreation . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -producer consumer . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -readers writers . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -round robin c . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -round robin scheduling . . . x . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -shortest seek time first . . x x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -smallest remaining time first . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 10 6 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 1 0 1 0 - - -RANDOMIZED ALGORITHMS Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -birthday paradox . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -karger minimum cut algorithm . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -kth smallest element algorithm . . x x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -random from stream . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -randomized quick sort . . x x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -reservoir sampling . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . -shuffle an array . . . x . . . . . . . . . x x . . . . . . . x . . . x . . x x . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 2 6 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 1 0 0 0 2 0 0 1 2 0 0 0 0 0 0 0 0 - - -SEARCH Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -binary search . . x x . . x . . . x . x x x . . x . . . . x . . . x x . x x x x . x . . x . -exponential search . . x x . . . . . . x . . x x . . . . . . . x . . . x . . x x . . . . . . . . -fibonacci search . . x x . . . . . . . . . . x . . . . . . . . . . . x . . . . . . . x . . . . -fuzzy search . . . . . . . . . . . . . . x . . . . . . . x . . . . . . . . . . . . . . . . -interpolation search . . x x . . . . . . x . . x x . . . . . . . x . . . x . . . . . . . . . . . . -jump search . . x x . . . . . . x . . x x . . . . . . . x . . . x . . . x . . . x . . . . -linear search . . x x x . . . . . x . x x x . . x . x x . x . . . x . x x x x . . x . . x . -ternary search . . x x . . . . . . x . . x x . . x . . . . x . . . x . . . x . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 7 7 1 0 1 0 0 0 6 0 2 6 8 0 0 3 0 1 1 0 7 0 0 0 7 1 1 3 5 2 1 0 4 0 0 2 0 - - -SELECTION ALGORITHMS Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -median of medians . . x . . . . . . . . . x . . . . . . . . . . . . . x . . . . . . . . . . . . -src . . . x . . . . . . x . . x . . . x . . . . . . . . x . . . . . . . x . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 1 1 0 0 0 0 0 0 1 0 1 1 0 0 0 1 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 1 0 0 0 0 - - -SORTING Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -bead sort . . x x . . . . . . . . . x x . . . . . . x x . . . x . . . . . . . x . . x . -bogo sort . . x x . . . . . . x . . x x . . . . . . x . x . . x . . x . . . . x . . . x -bubble sort . . x x . . x x . x x . x x x x . x . . . x x . . . x . . x x . x x x x . x . -bucket sort . . x x . . . . . . x . x x x . . . . . . x x . . . x . . x . . . . x . . x . -circle sort . . x x . . . . . . . . . x x . . . . . . x . . . . x . . . . . . . x . . x . -comb sort . . x x . . . . . . x . . x x . . . . . . x . . . . x . . . . . . . x . . . . -counting sort . . x x . . . . . . x . . x x . . . . . . x . . . . x . . . . . . . x . . x . -cycle sort . . x x . . . . . . x . . x x . . . . . . x . . . . x . . . . . . . x . . x . -flash sort . . x . . . . . . . . . . . x . . . . . . x . . . . . . . . . . . . x . . . . -gnome sort . . x x . . . . . . x . . x x . . . . . . x . . . . x . . . . . . . x . . . . -heap sort . . x x . . . . . . x . . x x . . . . . . x . . . . x . . x x x . . x . . x . -insertion sort . . x x . . . . . . x . x x x . . x . x . x x . . . x . x x x . x . x . . x . -intro sort . . . x . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . x . . . . -median sort . . . x . . . . . . . . . . . . . . . . . x . . . . x . . . . . . . x . . x . -merge sort . . x x . . . . . . x . x x x . . x . . . x x x . . x . . x x x x . x x . x x -pigeonhole sort . . x x . . . . . . x . . x x . . . . . . x x . . . x . . . . x . . x . . x . -quick sort . . x x . . . x . . x . x x x . . . x x . x . . . . x . . x x x x . x x . x . -radix sort . . x x . . . . . . x . x x x . . . . . . . . . . . x . . . x . . . . . . . . -selection sort . . x x . . . . . . x . x x x . . x . . . x x . . . x . . x x . x . x . x x . -shaker sort . . x x . . . . . . x . . x x . . . . . . x x . . . x . . . x . . . x . . x . -shell sort . . x x . . . . . . x . . x x . . x . . . x . . . . x . . . . . . . x . . . . -sleep sort . . x x . . . . . . x . . x x x . . . . . x x . . . x . . x . x x . x . . x . -stooge sort . . x . . . . . . . x . . x x . . . . . . . . . . . x . . . . . . . . . . . . -topological sort . . x x . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -tree sort . . x x . . . . . . x . . x x . . . . . . . . . . . x . . . . . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 23 23 0 0 1 2 0 1 19 0 7 22 22 2 0 5 1 2 0 21 9 2 0 0 23 0 1 9 8 5 6 1 21 3 1 15 2 - - -SQUARE ROOT DECOMPOSITION Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -mos algorithm . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 - - -STRING ALGORITHMS Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -aho corasick algorithm . . . x . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -anagram search . . x x . . . . . . x . . x x . . . . . . . . . . . x . . x . x . . x . . x . -arithmetic on large numbers . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -boyer moore algorithm . . x x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -c . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -finite automata . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . x . . . . . . . . -kasai algorithm . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -kmp algorithm . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -levenshtein distance . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -lipogram checker . . . x . . . . . . . . . . x . . . . . . . . . . . x . . . . . . . . . . x . -longest palindromic substring . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -manachar algorithm . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -morse code . . . x . . . . . . x . . . x . . . . . . . x . . . x . . . . . . . . . . . . -naive pattern search . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -palindrome checker . . x x x x x . x . x . x x x . . x x . . . x . . x x . . x x . x . x . . x . -palindrome substring . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -pangram checker . . x x . . . . . . x . . x x . . . . . . x x . . . x . . x . . . . x . . . . -password strength checker . . . x . . . . . . . . . x x . . . . . . . . . . . x . . . . . . . . . . x . -rabin karp algorithm . . x . . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -remove dups . . x x . . . . . . . . . . x . . . . . . . . . . . x . . . x . . . . . . . . -suffix array . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -trie pattern search . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -z algorithm . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 8 15 1 1 1 0 1 0 4 0 1 9 7 0 0 1 1 0 0 1 3 0 0 1 13 0 0 3 3 1 1 0 3 0 0 4 0 - - -THEORY OF COMPUTATION Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -deterministic finite automaton . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -nondeterministic finite atomaton . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 - - -UNCLASSIFIED Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -average . . x x . . x . x . x . . x x . . . . . . . x . . . x . . x x x x . x . . x . -biggest of n numbers . . x x . . . . . . . . . x x . . . . . . . . . . . x . . . . . . . . . . x . -biggest suffix . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -fifteen puzzle . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -jaccard similarity . . x . . . . . . . . . . x . . . . . . . . . . . . x . . . . . . . . . . . . -josephus problem . . x x . . . . . . x . . . . . . . . . . . . . . . x . . . . . . . . . . . . -lapindrom checker . . . x . . . . . . . . . . . . . . . . . . . . . . x . . . . . . . . . . . . -leap year . . x x . . . . . . x . . x . . . . . . x . . . . . x . . . x . . . . . . x . -magic square . . x . . . . . . . . . . . . . . . . . . . x . . . x . . . . . . . x . . . . -majority element . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -minimum subarray size with degree . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -no operator addition . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -optimized fibonacci . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -paint fill . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -smallest number to the left . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -spiral print . . x x . . . . . . x . . . . . . . . . . . . . . . x . . . . . . . . . . . . -split list . . . . . . . . . . . . . . x . . . . . . . . . . . x . . . . . . . . . . . . -tokenizer . . . x . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -unique number . . . . . . . . . . . . . x . . . . . . . . . . . . . . . . . . . . . . . . . -utilities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x . . . . . . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 10 12 0 0 1 0 1 0 4 0 0 5 3 0 0 0 0 0 1 0 2 0 0 0 9 0 0 1 2 1 2 0 2 0 0 3 0 - - -UTILITY Ada BrainFuck C C++ Clojure Crisp Elixir Elm Erlang Fortran Golang HTML Haskell Java JavaScript Julia Jupyter Notebook Kotlin Lua ML Nim Objective-C PHP Perl Processing Development Environment PureScript Python Racket Reason Ruby Rust Scala Shell Script Standard ML Swift TypeScript Visual Basic Visual C# Visual F# ------------------------------------------------ ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- -palindrome check . . x x . . . . . . . . . x x . . . . . x . . . . . x . . x . . . . . . . x . - ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- ----------------------------------- - 0 0 1 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 1 0 - - -=============================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== =================================== - TOTALS: 1 1 247 378 4 1 13 2 6 1 109 2 37 244 121 4 6 16 3 4 3 23 48 4 1 1 309 1 2 59 50 41 16 2 61 5 1 60 3 diff --git a/build/lib/dumps/catMap.p b/build/lib/dumps/catMap.p deleted file mode 100755 index efdd2fe..0000000 --- a/build/lib/dumps/catMap.p +++ /dev/null @@ -1,5319 +0,0 @@ -(dp0 -Vbreadth -p1 -(lp2 -I240 -asVmonte -p3 -(lp4 -I274 -aI275 -asVcode -p5 -(lp6 -I99 -aI100 -aI123 -aI139 -aI149 -aI160 -aI163 -aI167 -aI174 -aI215 -aI271 -aI278 -aI313 -aI338 -aI429 -aI433 -aI458 -aI479 -aI483 -aI492 -aI506 -aI534 -aI652 -aI659 -aI677 -aI684 -aI702 -aI713 -aI748 -aI753 -aI795 -aI799 -asVchain -p7 -(lp8 -I211 -asVsimilarity -p9 -(lp10 -I110 -asVhooks -p11 -(lp12 -I7 -asVdynamic -p13 -(lp14 -I174 -aI175 -aI176 -aI177 -aI178 -aI179 -aI180 -aI181 -aI182 -aI183 -aI184 -aI185 -aI186 -aI187 -aI188 -aI189 -aI190 -aI191 -aI192 -aI193 -aI194 -aI195 -aI196 -aI197 -aI198 -aI199 -aI200 -aI201 -aI202 -aI203 -aI204 -aI205 -aI206 -aI207 -aI208 -aI209 -aI210 -aI211 -aI212 -aI213 -aI214 -asV010 -p15 -(lp16 -I720 -asVprefix -p17 -(lp18 -I631 -asVradix -p19 -(lp20 -I511 -asVsleep -p21 -(lp22 -I514 -asVcomputation -p23 -(lp24 -I429 -aI430 -aI431 -aI432 -asVgo -p25 -(lp26 -I68 -aI69 -aI70 -aI71 -aI97 -asV019 -p27 -(lp28 -I745 -asVtotient -p29 -(lp30 -I391 -asVcenters -p31 -(lp32 -I135 -asVtaxicab -p33 -(lp34 -I421 -asVinverse -p35 -(lp36 -I364 -aI375 -asViterator -p37 -(lp38 -I282 -asVgraph -p39 -(lp40 -I194 -aI215 -aI216 -aI217 -aI218 -aI219 -aI220 -aI221 -aI222 -aI223 -aI224 -aI225 -aI226 -aI226 -aI227 -aI228 -aI229 -aI230 -aI231 -aI232 -aI233 -aI234 -aI235 -aI236 -aI237 -aI238 -aI240 -aI241 -aI242 -aI243 -aI244 -aI244 -aI245 -aI246 -aI247 -aI248 -aI248 -aI249 -aI250 -aI251 -aI252 -aI253 -aI254 -aI254 -aI255 -aI255 -aI256 -aI257 -aI258 -aI259 -aI260 -aI261 -aI261 -aI262 -aI263 -aI264 -aI265 -aI266 -aI266 -aI267 -aI268 -aI269 -aI270 -asVexponentiation -p41 -(lp42 -I393 -aI394 -aI394 -asVto -p43 -(lp44 -I120 -aI354 -aI498 -aI596 -aI629 -aI631 -asVneighbours -p45 -(lp46 -I763 -asVswap -p47 -(lp48 -I465 -asVth -p49 -(lp50 -I563 -asVskip -p51 -(lp52 -I550 -asVcentroid -p53 -(lp54 -I250 -asVundirected -p55 -(lp56 -I244 -asVdivision -p57 -(lp58 -I399 -aI467 -asVdigit -p59 -(lp60 -I206 -aI401 -aI415 -asVqueen -p61 -(lp62 -I808 -asVstring -p63 -(lp64 -I342 -aI405 -aI677 -aI678 -aI679 -aI680 -aI681 -aI682 -aI683 -aI684 -aI685 -aI687 -aI688 -aI689 -aI690 -aI691 -aI692 -aI693 -aI694 -aI695 -aI696 -aI697 -aI698 -aI699 -aI700 -aI701 -aI814 -asVegyptian -p65 -(lp66 -I138 -asVrod -p67 -(lp68 -I185 -asVsimpsons -p69 -(lp70 -I377 -asVcoprime -p71 -(lp72 -I408 -asVknapsack -p73 -(lp74 -I127 -aI203 -asVbounding -p75 -(lp76 -I663 -asVtridiagonal -p77 -(lp78 -I424 -asVstrand -p79 -(lp80 -I747 -asVpartitions -p81 -(lp82 -I807 -aI809 -asVmagic -p83 -(lp84 -I119 -aI402 -aI478 -asVhamiltonian -p85 -(lp86 -I235 -aI262 -asVlisp -p87 -(lp88 -I88 -asVknight -p89 -(lp90 -I805 -asVlist -p91 -(lp92 -I122 -aI536 -aI547 -aI548 -aI548 -aI549 -aI550 -aI550 -aI551 -aI551 -aI552 -aI552 -aI553 -aI554 -aI554 -aI555 -aI563 -aI596 -aI639 -aI641 -asV012 -p93 -(lp94 -I742 -asVlarge -p95 -(lp96 -I687 -asV013 -p97 -(lp98 -I741 -asVq -p99 -(lp100 -I779 -asVquick -p101 -(lp102 -I153 -aI504 -aI532 -asV014 -p103 -(lp104 -I731 -asVcorasick -p105 -(lp106 -I682 -asVmos -p107 -(lp108 -I798 -asVround -p109 -(lp110 -I324 -aI325 -aI325 -asV016 -p111 -(lp112 -I727 -asVfence -p113 -(lp114 -I453 -asVmiller -p115 -(lp116 -I351 -asVprediction -p117 -(lp118 -I750 -asVjump -p119 -(lp120 -I707 -asV018 -p121 -(lp122 -I740 -asVcost -p123 -(lp124 -I179 -aI202 -asVdesign -p125 -(lp126 -I278 -aI279 -aI280 -aI281 -aI282 -aI283 -aI310 -aI311 -aI312 -aI312 -asVinsertion -p127 -(lp128 -I210 -aI531 -aI566 -asVn -p129 -(lp130 -I106 -aI234 -aI368 -aI563 -aI808 -asVcarlo -p131 -(lp132 -I274 -aI275 -asVmachines -p133 -(lp134 -I780 -asVlinear -p135 -(lp136 -I708 -aI762 -asVintersection -p137 -(lp138 -I664 -aI670 -aI673 -asVxor -p139 -(lp140 -I465 -aI472 -aI475 -aI551 -asVsub -p141 -(lp142 -I184 -asV2sum -p143 -(lp144 -I419 -asVsum -p145 -(lp146 -I177 -aI180 -aI184 -aI204 -aI208 -aI344 -aI462 -aI472 -aI495 -aI541 -aI594 -aI595 -aI595 -aI810 -asVlexicographic -p147 -(lp148 -I342 -aI366 -asVastar -p149 -(lp150 -I265 -asVsteiner -p151 -(lp152 -I269 -asVfractional -p153 -(lp154 -I127 -asVincreasing -p155 -(lp156 -I180 -aI199 -aI209 -asVmethod -p157 -(lp158 -I390 -aI400 -aI411 -aI498 -asVcoefficient -p159 -(lp160 -I183 -aI345 -asVhash -p161 -(lp162 -I650 -asVdegree -p163 -(lp164 -I107 -asVtags -p165 -(lp166 -I11 -asVv -p167 -(lp168 -I336 -asVcomponent -p169 -(lp170 -I791 -asVequals -p171 -(lp172 -I472 -asV020 -p173 -(lp174 -I734 -asVmodular -p175 -(lp176 -I375 -asVobjects -p177 -(lp178 -I4 -aI5 -aI6 -asVoperating -p179 -(lp180 -I313 -aI314 -aI315 -aI316 -aI318 -aI320 -aI327 -aI330 -asVfree -p181 -(lp182 -I416 -asV102 -p183 -(lp184 -I743 -asVpath -p185 -(lp186 -I137 -aI179 -aI194 -aI224 -aI233 -aI247 -aI258 -aI262 -aI266 -aI267 -aI541 -aI594 -aI595 -asVsieve -p187 -(lp188 -I357 -aI362 -aI365 -asVfifteen -p189 -(lp190 -I121 -asVchange -p191 -(lp192 -I205 -asVbox -p193 -(lp194 -I189 -aI663 -asVpreorder -p195 -(lp196 -I259 -aI585 -aI586 -aI587 -aI602 -asVsearch -p197 -(lp198 -I196 -aI240 -aI263 -aI683 -aI691 -aI693 -aI702 -aI703 -aI704 -aI705 -aI705 -aI706 -aI706 -aI707 -aI707 -aI708 -aI708 -aI709 -aI709 -aI710 -aI710 -aI711 -aI711 -aI712 -aI712 -asVk -p199 -(lp200 -I135 -aI258 -aI763 -aI794 -asVlarger -p201 -(lp202 -I355 -asVchans -p203 -(lp204 -I666 -asVqueue -p205 -(lp206 -I322 -aI572 -aI573 -aI640 -aI641 -aI641 -aI642 -aI642 -aI643 -aI643 -aI644 -aI645 -aI645 -aI646 -aI646 -aI647 -aI647 -asVpoisson -p207 -(lp208 -I397 -asVpermutation -p209 -(lp210 -I366 -asVautomaton -p211 -(lp212 -I139 -aI140 -aI141 -aI142 -aI143 -aI144 -aI145 -aI146 -aI147 -aI148 -aI432 -asVkayle -p213 -(lp214 -I751 -asVdiameter -p215 -(lp216 -I540 -aI593 -asVtasks -p217 -(lp218 -I297 -aI298 -aI299 -aI301 -aI302 -asVshuffle -p219 -(lp220 -I154 -aI409 -asVconvolution -p221 -(lp222 -I417 -asVtokenizer -p223 -(lp224 -I105 -asVlempel-ziv-welch -p225 -(lp226 -I489 -asVwin -p227 -(lp228 -I750 -asVraphson -p229 -(lp230 -I390 -asVreplace -p231 -(lp232 -I374 -asVorder -p233 -(lp234 -I366 -asVsupersequence -p235 -(lp236 -I200 -asVtopological -p237 -(lp238 -I257 -aI526 -asVperceptron -p239 -(lp240 -I758 -asVfrom -p241 -(lp242 -I155 -aI259 -aI601 -aI602 -asV0 -p243 -(lp244 -I374 -asVmst -p245 -(lp246 -I232 -asVhanoi -p247 -(lp248 -I346 -asVtwo -p249 -(lp250 -I618 -asVpigeonhole -p251 -(lp252 -I522 -asVperl -p253 -(lp254 -I83 -asVautomata -p255 -(lp256 -I144 -aI146 -aI148 -aI685 -aI686 -asVmemory -p257 -(lp258 -I327 -aI328 -aI329 -aI329 -aI770 -aI771 -asVbead -p259 -(lp260 -I533 -asVrefs -p261 -(lp262 -I8 -aI9 -aI11 -aI12 -aI16 -aI17 -aI19 -asVmatlab -p263 -(lp264 -I771 -asVsort -p265 -(lp266 -I153 -aI257 -aI496 -aI504 -aI509 -aI510 -aI511 -aI512 -aI513 -aI514 -aI515 -aI516 -aI517 -aI518 -aI519 -aI520 -aI521 -aI522 -aI523 -aI524 -aI525 -aI526 -aI527 -aI528 -aI529 -aI530 -aI531 -aI532 -aI533 -aI564 -aI633 -asVpalindrome -p267 -(lp268 -I169 -aI170 -aI170 -aI172 -aI173 -aI173 -aI181 -aI210 -aI692 -aI695 -asVdiamond -p269 -(lp270 -I162 -asVerode -p271 -(lp272 -I788 -asVnaive -p273 -(lp274 -I693 -aI761 -aI768 -asVadjacency -p275 -(lp276 -I239 -aI255 -aI256 -aI256 -asVdiophantine -p277 -(lp278 -I410 -asVfloyd -p279 -(lp280 -I242 -asVoop -p281 -(lp282 -I283 -aI284 -aI285 -aI291 -aI292 -aI295 -aI304 -aI306 -aI308 -asVstochastic -p283 -(lp284 -I777 -asVquickhull -p285 -(lp286 -I667 -asValigned -p287 -(lp288 -I663 -asV008 -p289 -(lp290 -I719 -asVpangram -p291 -(lp292 -I699 -asVsample -p293 -(lp294 -I397 -asVdeadlocks -p295 -(lp296 -I316 -aI317 -asVkasai -p297 -(lp298 -I690 -asVbits -p299 -(lp300 -I463 -aI471 -aI473 -asVml -p301 -(lp302 -I82 -asVprinting -p303 -(lp304 -I102 -asVkotlin -p305 -(lp306 -I30 -aI31 -aI32 -aI33 -aI80 -asVroot -p307 -(lp308 -I795 -aI796 -aI797 -aI798 -asVexample -p309 -(lp310 -I442 -asVfibonacci -p311 -(lp312 -I349 -aI706 -asVhodgeman -p313 -(lp314 -I665 -asVnearest -p315 -(lp316 -I763 -aI770 -aI771 -asVmultiway -p317 -(lp318 -I543 -aI544 -aI545 -aI611 -aI612 -aI613 -aI614 -aI615 -aI616 -asVstream -p319 -(lp320 -I155 -aI373 -aI643 -asVscan -p321 -(lp322 -I676 -asVstacking -p323 -(lp324 -I189 -asVpermutations -p325 -(lp326 -I814 -asVtable -p327 -(lp328 -I650 -asVbellman -p329 -(lp330 -I251 -asVsubstring -p331 -(lp332 -I186 -aI198 -aI695 -asVcollision -p333 -(lp334 -I663 -asVminimum -p335 -(lp336 -I107 -aI125 -aI131 -aI132 -aI133 -aI157 -aI202 -aI210 -aI227 -aI228 -aI230 -aI249 -aI253 -aI591 -asVnumbers -p337 -(lp338 -I106 -aI367 -aI368 -aI373 -aI403 -aI408 -aI421 -aI425 -aI428 -aI462 -aI687 -aI751 -asVscheduling -p339 -(lp340 -I195 -aI320 -aI321 -aI322 -aI322 -aI323 -aI324 -aI324 -aI325 -aI326 -asVspanning -p341 -(lp342 -I125 -aI131 -aI133 -aI228 -aI230 -aI249 -asVcounting -p343 -(lp344 -I517 -asVautokey -p345 -(lp346 -I456 -asVbogo -p347 -(lp348 -I523 -asVgcd -p349 -(lp350 -I347 -asVconvolutional -p351 -(lp352 -I793 -asVdivided -p353 -(lp354 -I414 -asVmachine -p355 -(lp356 -I769 -aI773 -asVwriters -p357 -(lp358 -I332 -asVoptimal -p359 -(lp360 -I196 -asVaxis -p361 -(lp362 -I663 -aI671 -asVcircular -p363 -(lp364 -I552 -aI553 -aI644 -asVbaconian -p365 -(lp366 -I435 -aI446 -asVemde -p367 -(lp368 -I580 -aI612 -asVmax -p369 -(lp370 -I498 -aI576 -asVmapping -p371 -(lp372 -I329 -asVmac -p373 -(lp374 -I28 -aI32 -aI36 -aI40 -aI44 -aI50 -aI54 -aI58 -aI62 -aI66 -aI70 -aI74 -asVbirthday -p375 -(lp376 -I156 -asVmultiplication -p377 -(lp378 -I211 -aI392 -aI406 -aI500 -aI503 -asVdata -p379 -(lp380 -I238 -aI239 -aI534 -aI535 -aI536 -aI537 -aI546 -aI547 -aI568 -aI627 -aI628 -aI639 -aI640 -aI648 -aI651 -asVpostorder -p381 -(lp382 -I259 -aI601 -asVa -p383 -(lp384 -I778 -aI804 -asVacyclic -p385 -(lp386 -I266 -asVbranches -p387 -(lp388 -I13 -asVjohnson -p389 -(lp390 -I233 -asVpostfix -p391 -(lp392 -I629 -aI631 -aI632 -asVelement -p393 -(lp394 -I104 -aI152 -asVheight -p395 -(lp396 -I591 -aI598 -asValgorithms -p397 -(lp398 -I123 -aI124 -aI125 -aI126 -aI127 -aI128 -aI129 -aI130 -aI131 -aI132 -aI133 -aI134 -aI135 -aI136 -aI137 -aI138 -aI149 -aI150 -aI151 -aI152 -aI153 -aI154 -aI155 -aI156 -aI157 -aI158 -aI159 -aI163 -aI164 -aI165 -aI166 -aI215 -aI216 -aI217 -aI218 -aI219 -aI220 -aI221 -aI222 -aI223 -aI224 -aI225 -aI226 -aI227 -aI228 -aI229 -aI230 -aI231 -aI232 -aI233 -aI234 -aI235 -aI236 -aI237 -aI238 -aI240 -aI241 -aI242 -aI243 -aI244 -aI245 -aI246 -aI247 -aI248 -aI249 -aI250 -aI251 -aI252 -aI253 -aI254 -aI255 -aI257 -aI258 -aI259 -aI260 -aI261 -aI262 -aI263 -aI264 -aI265 -aI266 -aI267 -aI268 -aI269 -aI270 -aI338 -aI339 -aI340 -aI341 -aI342 -aI343 -aI344 -aI345 -aI346 -aI347 -aI348 -aI349 -aI350 -aI354 -aI355 -aI356 -aI357 -aI358 -aI359 -aI360 -aI361 -aI362 -aI363 -aI364 -aI365 -aI366 -aI367 -aI368 -aI369 -aI370 -aI371 -aI372 -aI373 -aI374 -aI375 -aI376 -aI377 -aI378 -aI387 -aI388 -aI389 -aI390 -aI391 -aI392 -aI393 -aI395 -aI396 -aI397 -aI398 -aI399 -aI400 -aI401 -aI402 -aI403 -aI404 -aI405 -aI406 -aI407 -aI408 -aI409 -aI410 -aI411 -aI412 -aI413 -aI414 -aI415 -aI416 -aI417 -aI418 -aI419 -aI420 -aI421 -aI422 -aI423 -aI424 -aI425 -aI426 -aI427 -aI428 -aI677 -aI678 -aI679 -aI680 -aI681 -aI682 -aI683 -aI684 -aI685 -aI687 -aI688 -aI689 -aI690 -aI691 -aI692 -aI693 -aI694 -aI695 -aI696 -aI697 -aI698 -aI699 -aI700 -aI701 -asVatomaton -p399 -(lp400 -I431 -asVrepresentation -p401 -(lp402 -I255 -aI256 -asVegg -p403 -(lp404 -I192 -asVbipartite -p405 -(lp406 -I222 -aI229 -aI236 -asVoperations -p407 -(lp408 -I553 -aI555 -aI556 -aI557 -aI558 -aI559 -aI560 -aI561 -aI562 -aI563 -aI564 -aI565 -aI566 -aI567 -asVgrundy -p409 -(lp410 -I751 -asVfeedback -p411 -(lp412 -I322 -asVreservoir -p413 -(lp414 -I158 -asVis -p415 -(lp416 -I418 -aI542 -aI592 -aI597 -aI605 -asVusing -p417 -(lp418 -I463 -aI496 -aI641 -aI646 -asVmove -p419 -(lp420 -I752 -asVbalanced -p421 -(lp422 -I635 -asVbrain -p423 -(lp424 -I142 -asVpascal -p425 -(lp426 -I72 -aI73 -aI74 -aI75 -aI98 -aI356 -asVcomputational -p427 -(lp428 -I659 -aI660 -aI661 -aI662 -aI663 -aI664 -aI665 -aI666 -aI667 -aI668 -aI669 -aI670 -aI671 -aI672 -aI673 -aI674 -aI675 -aI676 -asVsame -p429 -(lp430 -I542 -aI605 -asVconcurrency -p431 -(lp432 -I330 -aI331 -aI332 -aI333 -aI335 -aI337 -asVcsharp -p433 -(lp434 -I441 -aI442 -asVpeterson -p435 -(lp436 -I333 -aI334 -aI334 -asVperfect -p437 -(lp438 -I361 -asVbridges -p439 -(lp440 -I248 -asVstyle -p441 -(lp442 -I76 -aI77 -aI78 -aI79 -aI80 -aI81 -aI82 -aI83 -aI84 -aI85 -aI86 -aI87 -aI88 -aI89 -aI90 -aI91 -aI92 -aI93 -aI97 -aI98 -aI775 -asVexclusion -p443 -(lp444 -I333 -aI334 -asVimg -p445 -(lp446 -I657 -aI787 -asVprewittfilter -p447 -(lp448 -I782 -asVfermats -p449 -(lp450 -I423 -asVaffine -p451 -(lp452 -I455 -asVsquaring -p453 -(lp454 -I394 -asVlossless -p455 -(lp456 -I485 -aI486 -aI488 -aI489 -aI490 -asVhashs -p457 -(lp458 -I648 -aI649 -aI650 -asVpolicy -p459 -(lp460 -I312 -asVtravelling -p461 -(lp462 -I232 -asVmain -p463 -(lp464 -I381 -aI382 -asVimage -p465 -(lp466 -I781 -aI782 -aI783 -aI784 -aI785 -aI786 -aI786 -aI787 -aI788 -asVtsp -p467 -(lp468 -I764 -asVprime -p469 -(lp470 -I341 -aI368 -asVtypescript -p471 -(lp472 -I77 -asVdna -p473 -(lp474 -I747 -asVpython -p475 -(lp476 -I42 -aI43 -aI44 -aI45 -aI46 -aI47 -aI86 -asVaho -p477 -(lp478 -I682 -asVnewman -p479 -(lp480 -I359 -asVflash -p481 -(lp482 -I510 -asVrosalind -p483 -(lp484 -I746 -aI747 -asVcutting -p485 -(lp486 -I185 -asVconquer -p487 -(lp488 -I492 -aI493 -aI494 -aI495 -aI496 -aI496 -aI497 -aI498 -aI499 -aI500 -aI501 -aI502 -aI503 -aI504 -aI505 -asVtribonacci -p489 -(lp490 -I367 -asV022 -p491 -(lp492 -I737 -asVsorted -p493 -(lp494 -I567 -asVboruvka -p495 -(lp496 -I249 -asV028 -p497 -(lp498 -I721 -asVinversion -p499 -(lp500 -I499 -asVswapper -p501 -(lp502 -I477 -asVwarshall -p503 -(lp504 -I130 -aI242 -asVbrians -p505 -(lp506 -I142 -asVlevel -p507 -(lp508 -I322 -asVporta -p509 -(lp510 -I447 -asV2d -p511 -(lp512 -I671 -aI673 -asVmerge -p513 -(lp514 -I496 -aI525 -aI567 -asVpeasant -p515 -(lp516 -I392 -asVarraystack -p517 -(lp518 -I638 -asVrepeating -p519 -(lp520 -I176 -aI188 -asVsubset -p521 -(lp522 -I177 -aI204 -aI469 -aI810 -asVsquare -p523 -(lp524 -I119 -aI162 -aI402 -aI416 -aI418 -aI795 -aI796 -aI797 -aI798 -asVlogs -p525 -(lp526 -I15 -aI16 -asVweight -p527 -(lp528 -I194 -asVgeneration -p529 -(lp530 -I469 -asVcontiguous -p531 -(lp532 -I208 -aI495 -asVgaussian -p533 -(lp534 -I378 -aI379 -aI383 -aI384 -aI481 -aI761 -aI767 -asVnumeric -p535 -(lp536 -I212 -asVchallenges -p537 -(lp538 -I713 -aI714 -aI715 -aI716 -aI746 -asVoperator -p539 -(lp540 -I116 -asVatbash -p541 -(lp542 -I457 -asVremove -p543 -(lp544 -I681 -asVyear -p545 -(lp546 -I111 -asVseparating -p547 -(lp548 -I671 -asVsalesman -p549 -(lp550 -I232 -asVmonitors -p551 -(lp552 -I335 -aI336 -aI336 -asVdbscan -p553 -(lp554 -I756 -asVnetwork -p555 -(lp556 -I294 -aI757 -aI790 -aI793 -asVfactors -p557 -(lp558 -I341 -asVgradient -p559 -(lp560 -I766 -asVrestricted -p561 -(lp562 -I773 -asVfactory -p563 -(lp564 -I306 -aI307 -asVsolovay-strassen -p565 -(lp566 -I353 -asVvector -p567 -(lp568 -I769 -asVhill -p569 -(lp570 -I376 -asVprint -p571 -(lp572 -I114 -aI561 -asVevaluation -p573 -(lp574 -I389 -aI632 -asVred -p575 -(lp576 -I544 -aI613 -asVtheory -p577 -(lp578 -I429 -aI430 -aI431 -aI432 -aI748 -aI749 -aI750 -aI751 -aI752 -asVtransfer -p579 -(lp580 -I775 -asVgreedy -p581 -(lp582 -I123 -aI124 -aI125 -aI126 -aI127 -aI128 -aI129 -aI130 -aI131 -aI132 -aI133 -aI134 -aI135 -aI136 -aI137 -aI138 -asVproxy -p583 -(lp584 -I285 -aI286 -aI287 -aI288 -aI289 -aI290 -asVboosting -p585 -(lp586 -I766 -asVnetworking -p587 -(lp588 -I652 -aI653 -aI654 -aI655 -aI656 -aI658 -asVbyte -p589 -(lp590 -I477 -asVinfix -p591 -(lp592 -I629 -asVshortest -p593 -(lp594 -I137 -aI200 -aI233 -aI247 -aI258 -aI326 -asVcompression -p595 -(lp596 -I483 -aI484 -aI485 -aI485 -aI486 -aI487 -aI488 -aI488 -aI489 -aI490 -aI491 -aI491 -asV003 -p597 -(lp598 -I726 -asVmedian-of-medians -p599 -(lp600 -I166 -asVgeometry -p601 -(lp602 -I659 -aI660 -aI661 -aI662 -aI663 -aI664 -aI665 -aI666 -aI667 -aI668 -aI669 -aI670 -aI671 -aI672 -aI673 -aI674 -aI675 -aI676 -asVbitonic -p603 -(lp604 -I201 -asVprogramming -p605 -(lp606 -I174 -aI175 -aI176 -aI177 -aI178 -aI179 -aI180 -aI181 -aI182 -aI183 -aI184 -aI185 -aI186 -aI187 -aI188 -aI189 -aI190 -aI191 -aI192 -aI193 -aI194 -aI195 -aI196 -aI197 -aI198 -aI199 -aI200 -aI201 -aI202 -aI203 -aI204 -aI205 -aI206 -aI207 -aI208 -aI209 -aI210 -aI211 -aI212 -aI213 -aI214 -asVfilter -p607 -(lp608 -I481 -aI482 -aI649 -asVsignature -p609 -(lp610 -I448 -asVfirst -p611 -(lp612 -I240 -aI263 -aI321 -aI321 -aI323 -aI326 -asVorigin -p613 -(lp614 -I10 -aI18 -asVinfo -p615 -(lp616 -I5 -aI14 -asVsingleton -p617 -(lp618 -I281 -aI284 -asVsuffix -p619 -(lp620 -I112 -aI578 -aI689 -asVencoding -p621 -(lp622 -I449 -asV004 -p623 -(lp624 -I722 -asVcoding -p625 -(lp626 -I76 -aI77 -aI78 -aI79 -aI80 -aI81 -aI82 -aI83 -aI84 -aI85 -aI86 -aI87 -aI88 -aI89 -aI90 -aI91 -aI92 -aI93 -aI97 -aI98 -aI134 -asVnumber -p627 -(lp628 -I113 -aI120 -aI349 -aI355 -aI358 -aI361 -aI369 -aI387 -aI388 -aI395 -aI401 -aI415 -aI416 -aI464 -aI468 -aI474 -aI478 -aI809 -aI812 -asVrank -p629 -(lp630 -I342 -asVtransform -p631 -(lp632 -I426 -asVrandomized -p633 -(lp634 -I149 -aI150 -aI151 -aI152 -aI153 -aI153 -aI154 -aI155 -aI156 -aI157 -aI158 -aI159 -asVarray -p635 -(lp636 -I154 -aI191 -aI409 -aI578 -aI689 -asVsutherland -p637 -(lp638 -I665 -aI674 -asV009 -p639 -(lp640 -I735 -asVsize -p641 -(lp642 -I107 -asVlittle -p643 -(lp644 -I423 -asVmanagement -p645 -(lp646 -I327 -aI328 -aI329 -asVheads -p647 -(lp648 -I12 -aI19 -asVobserver -p649 -(lp650 -I291 -aI292 -aI293 -aI293 -aI294 -asVbloom -p651 -(lp652 -I649 -asVsystem -p653 -(lp654 -I313 -aI314 -aI315 -aI316 -aI318 -aI320 -aI327 -aI330 -aI336 -asVleast -p655 -(lp656 -I328 -asVstack -p657 -(lp658 -I628 -aI629 -aI630 -aI630 -aI631 -aI632 -aI633 -aI633 -aI634 -aI634 -aI635 -aI636 -aI636 -aI637 -aI646 -asVpriority -p659 -(lp660 -I572 -aI573 -asVpaint -p661 -(lp662 -I109 -asVchecker -p663 -(lp664 -I115 -aI680 -aI692 -aI697 -aI699 -asV2 -p665 -(lp666 -I476 -asVkarger -p667 -(lp668 -I157 -aI253 -asV.git -p669 -(lp670 -I3 -aI4 -aI7 -aI8 -aI13 -aI14 -aI15 -asVrabin -p671 -(lp672 -I351 -aI696 -asVstructures -p673 -(lp674 -I238 -aI239 -aI385 -aI534 -aI535 -aI536 -aI537 -aI546 -aI547 -aI568 -aI627 -aI628 -aI639 -aI640 -aI648 -aI651 -asVjarvis -p675 -(lp676 -I672 -asVshell -p677 -(lp678 -I318 -aI319 -aI521 -asV067 -p679 -(lp680 -I736 -asVgym -p681 -(lp682 -I298 -asVserve -p683 -(lp684 -I321 -asVrsa -p685 -(lp686 -I437 -aI448 -asVlists -p687 -(lp688 -I255 -aI256 -aI256 -asVthreaded -p689 -(lp690 -I589 -asVmanipulation -p691 -(lp692 -I458 -aI459 -aI460 -aI461 -aI462 -aI463 -aI464 -aI465 -aI466 -aI467 -aI468 -aI469 -aI470 -aI471 -aI472 -aI473 -aI474 -aI475 -aI476 -aI477 -aI478 -asVpacketsniffer -p693 -(lp694 -I656 -aI657 -asVquad -p695 -(lp696 -I622 -asVstd -p697 -(lp698 -I412 -asVdistance -p699 -(lp700 -I190 -aI470 -aI675 -aI688 -asVb -p701 -(lp702 -I617 -aI618 -aI619 -aI619 -aI620 -aI620 -asVthird -p703 -(lp704 -I22 -aI23 -asVautomorphic -p705 -(lp706 -I403 -asVbag -p707 -(lp708 -I627 -asVdfa -p709 -(lp710 -I399 -asVlangtons -p711 -(lp712 -I143 -asVneural -p713 -(lp714 -I757 -aI775 -aI790 -aI793 -asVtree -p715 -(lp716 -I125 -aI131 -aI133 -aI196 -aI228 -aI230 -aI231 -aI237 -aI249 -aI269 -aI512 -aI537 -aI538 -aI538 -aI539 -aI539 -aI540 -aI541 -aI542 -aI543 -aI543 -aI544 -aI544 -aI545 -aI568 -aI569 -aI573 -aI577 -aI577 -aI578 -aI579 -aI580 -aI580 -aI581 -aI581 -aI582 -aI583 -aI583 -aI584 -aI591 -aI592 -aI592 -aI593 -aI594 -aI596 -aI597 -aI598 -aI599 -aI600 -aI600 -aI601 -aI602 -aI603 -aI603 -aI604 -aI604 -aI605 -aI606 -aI606 -aI607 -aI608 -aI608 -aI609 -aI610 -aI610 -aI611 -aI611 -aI612 -aI612 -aI613 -aI613 -aI614 -aI615 -aI615 -aI616 -aI616 -aI617 -aI617 -aI618 -aI618 -aI619 -aI619 -aI620 -aI620 -aI621 -aI621 -aI622 -aI622 -aI623 -aI623 -aI624 -aI624 -aI625 -aI625 -aI626 -aI626 -aI760 -asVproject -p717 -(lp718 -I386 -aI716 -aI717 -aI718 -aI719 -aI720 -aI721 -aI722 -aI723 -aI724 -aI725 -aI726 -aI727 -aI728 -aI729 -aI730 -aI731 -aI732 -aI733 -aI734 -aI735 -aI736 -aI737 -aI738 -aI739 -aI740 -aI741 -aI742 -aI743 -aI744 -aI745 -asVsubsequence -p719 -(lp720 -I176 -aI180 -aI188 -aI199 -aI209 -aI213 -aI495 -asVbiconnected -p721 -(lp722 -I245 -asVkth -p723 -(lp724 -I152 -asVdoubly -p725 -(lp726 -I548 -aI549 -aI596 -asVand -p727 -(lp728 -I259 -aI347 -aI496 -aI601 -aI602 -asVbridge -p729 -(lp730 -I231 -asVkarp -p731 -(lp732 -I221 -aI696 -asVlinkedlist -p733 -(lp734 -I159 -asVkutt -p735 -(lp736 -I276 -aI277 -asVcohen -p737 -(lp738 -I674 -asVant -p739 -(lp740 -I143 -asVmanachar -p741 -(lp742 -I698 -asV026 -p743 -(lp744 -I718 -asVlargrange -p745 -(lp746 -I413 -asVdisjoint -p747 -(lp748 -I243 -asVseek -p749 -(lp750 -I326 -asVlinked -p751 -(lp752 -I548 -aI549 -aI551 -aI552 -aI553 -aI554 -aI555 -aI563 -aI596 -aI639 -aI641 -asVsat -p753 -(lp754 -I759 -asVpaths -p755 -(lp756 -I243 -asVconversion -p757 -(lp758 -I396 -asVstrength -p759 -(lp760 -I680 -asValgorithm-x -p761 -(lp762 -I806 -asVmin -p763 -(lp764 -I179 -aI498 -aI574 -asVbron -p765 -(lp766 -I264 -asVmajority -p767 -(lp768 -I104 -asVcaesar -p769 -(lp770 -I438 -asVbest -p771 -(lp772 -I752 -asVonline -p773 -(lp774 -I713 -aI714 -aI715 -aI716 -aI746 -asVchannel -p775 -(lp776 -I225 -asVbuffer -p777 -(lp778 -I644 -asVzigzag -p779 -(lp780 -I590 -asVsplay -p781 -(lp782 -I615 -asVy -p783 -(lp784 -I501 -asVboltzmann -p785 -(lp786 -I773 -asVcipher -p787 -(lp788 -I435 -aI438 -aI439 -aI445 -aI446 -aI447 -aI450 -aI451 -aI452 -aI453 -aI454 -aI455 -aI456 -aI457 -asVconnected -p789 -(lp790 -I260 -aI268 -aI270 -asVscripts -p791 -(lp792 -I21 -asVmultiply -p793 -(lp794 -I370 -asVcoin -p795 -(lp796 -I205 -asVcellular -p797 -(lp798 -I139 -aI140 -aI141 -aI142 -aI143 -aI144 -aI144 -aI145 -aI146 -aI146 -aI147 -aI148 -aI148 -asVmodel -p799 -(lp800 -I767 -asVkd -p801 -(lp802 -I625 -asVwindows -p803 -(lp804 -I29 -aI33 -aI37 -aI41 -aI45 -aI51 -aI55 -aI59 -aI63 -aI67 -aI71 -aI75 -asVaverage -p805 -(lp806 -I117 -aI373 -asVpartition -p807 -(lp808 -I181 -asVcover -p809 -(lp810 -I241 -asVvertices -p811 -(lp812 -I220 -asVnobili -p813 -(lp814 -I148 -asVpoints -p815 -(lp816 -I502 -aI675 -asVhamming -p817 -(lp818 -I470 -asVconsumer -p819 -(lp820 -I337 -asVselection -p821 -(lp822 -I128 -aI163 -aI164 -aI165 -aI166 -aI516 -asVprim -p823 -(lp824 -I133 -aI230 -asVjosephus -p825 -(lp826 -I108 -asVdups -p827 -(lp828 -I681 -asVendianess -p829 -(lp830 -I658 -asVrandom -p831 -(lp832 -I155 -aI159 -aI789 -asVrussian -p833 -(lp834 -I392 -asVfuzzy -p835 -(lp836 -I710 -asVsoldiers -p837 -(lp838 -I305 -asVdecoding -p839 -(lp840 -I405 -asVfind -p841 -(lp842 -I498 -aI545 -aI559 -aI614 -asVbacktracking -p843 -(lp844 -I799 -aI800 -aI801 -aI802 -aI803 -aI804 -aI805 -aI806 -aI807 -aI808 -aI809 -aI810 -aI811 -aI812 -aI813 -aI814 -asVmake -p845 -(lp846 -I600 -aI601 -aI602 -aI606 -asVcoloring -p847 -(lp848 -I254 -aI813 -asVbased -p849 -(lp850 -I312 -asVproducer -p851 -(lp852 -I337 -asVdistributed -p853 -(lp854 -I777 -asVfulkerson -p855 -(lp856 -I219 -asVblack -p857 -(lp858 -I544 -aI613 -asVpandigital -p859 -(lp860 -I387 -asVcircle -p861 -(lp862 -I509 -asVkaratsuba -p863 -(lp864 -I406 -aI503 -asVip -p865 -(lp866 -I655 -asVdirected -p867 -(lp868 -I261 -aI266 -asVmixture -p869 -(lp870 -I767 -asVtriangle -p871 -(lp872 -I356 -aI662 -asVcryptography -p873 -(lp874 -I433 -aI434 -aI435 -aI436 -aI437 -aI438 -aI439 -aI440 -aI443 -aI445 -aI446 -aI447 -aI448 -aI449 -aI450 -aI451 -aI452 -aI453 -aI454 -aI455 -aI456 -aI457 -asVmeans -p875 -(lp876 -I794 -asVbetween -p877 -(lp878 -I675 -asVbresenham -p879 -(lp880 -I668 -asVlucky -p881 -(lp882 -I395 -asVtrees -p883 -(lp884 -I766 -asVm -p885 -(lp886 -I813 -asVremotes -p887 -(lp888 -I9 -aI10 -aI17 -aI18 -asVones -p889 -(lp890 -I207 -asVdelannoy -p891 -(lp892 -I358 -asVlongest -p893 -(lp894 -I176 -aI186 -aI187 -aI188 -aI193 -aI198 -aI199 -aI201 -aI209 -aI213 -aI266 -asV128 -p895 -(lp896 -I440 -aI441 -asVmorse -p897 -(lp898 -I450 -aI684 -asVdp -p899 -(lp900 -I206 -asVclosure -p901 -(lp902 -I226 -asVaes -p903 -(lp904 -I440 -aI441 -aI441 -aI442 -asVstitching -p905 -(lp906 -I786 -aI787 -asVtwice -p907 -(lp908 -I474 -asVtransposition -p909 -(lp910 -I452 -asVmedian -p911 -(lp912 -I191 -aI482 -aI524 -asVdijkstra -p913 -(lp914 -I137 -aI247 -asVc++ -p915 -(lp916 -I2 -aI64 -aI65 -aI66 -aI67 -aI93 -aI94 -asVmorning -p917 -(lp918 -I299 -aI300 -asVtriplet -p919 -(lp920 -I404 -asVsha -p921 -(lp922 -I443 -aI444 -aI444 -asVcommon -p923 -(lp924 -I198 -aI200 -aI209 -aI213 -asVlogistic -p925 -(lp926 -I772 -asVactivity -p927 -(lp928 -I128 -asVx -p929 -(lp930 -I501 -asVview -p931 -(lp932 -I237 -aI586 -aI587 -aI604 -asVset -p933 -(lp934 -I193 -aI194 -aI473 -aI807 -asVfilters -p935 -(lp936 -I479 -aI480 -aI481 -aI482 -asVkeypad -p937 -(lp938 -I212 -asVprincipal -p939 -(lp940 -I791 -asVintelligence -p941 -(lp942 -I753 -aI754 -aI755 -aI756 -aI757 -aI758 -aI759 -aI760 -aI761 -aI762 -aI763 -aI764 -aI765 -aI766 -aI767 -aI768 -aI769 -aI770 -aI772 -aI773 -aI774 -aI775 -aI776 -aI777 -aI778 -aI779 -aI780 -aI781 -aI789 -aI790 -aI791 -aI792 -aI793 -aI794 -asVflip -p943 -(lp944 -I471 -asVcomputer -p945 -(lp946 -I160 -aI161 -aI162 -asVprimality -p947 -(lp948 -I350 -aI351 -aI351 -aI352 -aI352 -aI353 -aI353 -asV036 -p949 -(lp950 -I729 -asV037 -p951 -(lp952 -I733 -asV034 -p953 -(lp954 -I739 -asVpolybius -p955 -(lp956 -I454 -asVdetect -p957 -(lp958 -I560 -asVways -p959 -(lp960 -I234 -aI812 -asVpattern -p961 -(lp962 -I278 -aI279 -aI280 -aI281 -aI281 -aI282 -aI282 -aI283 -aI284 -aI291 -aI310 -aI311 -aI311 -aI312 -aI683 -aI693 -asVartificial -p963 -(lp964 -I753 -aI754 -aI755 -aI756 -aI757 -aI758 -aI759 -aI760 -aI761 -aI762 -aI763 -aI764 -aI765 -aI766 -aI767 -aI768 -aI769 -aI770 -aI772 -aI773 -aI774 -aI775 -aI776 -aI777 -aI778 -aI779 -aI780 -aI781 -aI789 -aI790 -aI790 -aI791 -aI792 -aI793 -aI794 -asVpowerset -p965 -(lp966 -I811 -asVcrossword -p967 -(lp968 -I802 -asVsmallest -p969 -(lp970 -I120 -aI152 -aI323 -aI415 -asVroutine -p971 -(lp972 -I300 -aI303 -asVsubarray -p973 -(lp974 -I107 -aI208 -asVinorder -p975 -(lp976 -I259 -aI588 -aI589 -aI601 -aI602 -asVderangements -p977 -(lp978 -I371 -asVrecently -p979 -(lp980 -I328 -asVcomplement -p981 -(lp982 -I747 -asVjavascript -p983 -(lp984 -I56 -aI57 -aI58 -aI59 -aI91 -asVf# -p985 -(lp986 -I84 -asVdeterministic -p987 -(lp988 -I432 -asVjob -p989 -(lp990 -I136 -aI195 -aI301 -asVcomb -p991 -(lp992 -I519 -asVswift -p993 -(lp994 -I52 -aI53 -aI54 -aI55 -aI90 -asVproblem -p995 -(lp996 -I108 -aI197 -aI212 -aI717 -aI718 -aI719 -aI720 -aI721 -aI722 -aI723 -aI724 -aI725 -aI726 -aI727 -aI728 -aI729 -aI730 -aI731 -aI732 -aI733 -aI734 -aI735 -aI736 -aI737 -aI738 -aI739 -aI740 -aI741 -aI742 -aI743 -aI744 -aI745 -aI813 -asVfactorization -p997 -(lp998 -I780 -asVc -p999 -(lp1000 -I38 -aI39 -aI40 -aI41 -aI85 -aI239 -aI256 -aI319 -aI325 -aI334 -aI549 -aI620 -aI686 -asVinstallation -p1001 -(lp1002 -I25 -aI26 -aI30 -aI34 -aI38 -aI42 -aI46 -aI48 -aI52 -aI56 -aI60 -aI64 -aI68 -aI72 -asVreverse -p1003 -(lp1004 -I360 -aI388 -aI558 -aI561 -aI630 -aI645 -asVadapter -p1005 -(lp1006 -I304 -aI305 -asVreaders -p1007 -(lp1008 -I332 -asVspace -p1009 -(lp1010 -I621 -aI622 -aI623 -aI624 -aI625 -asVs -p1011 -(lp1012 -I227 -asVprotection -p1013 -(lp1014 -I289 -aI290 -asVconsec -p1015 -(lp1016 -I207 -asVembedding -p1017 -(lp1018 -I777 -asVexpression -p1019 -(lp1020 -I635 -asVboyer -p1021 -(lp1022 -I701 -asVaa -p1023 -(lp1024 -I608 -asVsphere -p1025 -(lp1026 -I664 -asVpassword -p1027 -(lp1028 -I680 -asVsampling -p1029 -(lp1030 -I158 -asVlearning -p1031 -(lp1032 -I779 -asVlinux -p1033 -(lp1034 -I27 -aI31 -aI35 -aI39 -aI43 -aI47 -aI49 -aI53 -aI57 -aI61 -aI65 -aI69 -aI73 -asVpolynomial -p1035 -(lp1036 -I370 -aI389 -aI407 -aI413 -asVboas -p1037 -(lp1038 -I580 -aI612 -asVlipogram -p1039 -(lp1040 -I697 -asV256 -p1041 -(lp1042 -I444 -asVjava -p1043 -(lp1044 -I60 -aI61 -aI62 -aI63 -aI92 -aI292 -aI293 -asVaddition -p1045 -(lp1046 -I116 -aI463 -asVcome -p1047 -(lp1048 -I321 -asVinvert -p1049 -(lp1050 -I466 -asVthree -p1051 -(lp1052 -I618 -asVtreap -p1053 -(lp1054 -I582 -asVgenetic -p1055 -(lp1056 -I147 -asVdropping -p1057 -(lp1058 -I192 -asVcolumnar -p1059 -(lp1060 -I452 -asVthrice -p1061 -(lp1062 -I464 -asVdigits -p1063 -(lp1064 -I344 -aI348 -asVlife -p1065 -(lp1066 -I145 -asVbit -p1067 -(lp1068 -I458 -aI459 -aI460 -aI461 -aI462 -aI463 -aI464 -aI465 -aI466 -aI466 -aI467 -aI467 -aI468 -aI469 -aI470 -aI471 -aI472 -aI473 -aI474 -aI475 -aI476 -aI477 -aI478 -asVc# -p1069 -(lp1070 -I89 -asVparenthesization -p1071 -(lp1072 -I182 -asVconvert -p1073 -(lp1074 -I468 -aI596 -asVtraversal -p1075 -(lp1076 -I584 -aI585 -aI588 -aI590 -asVjacobi -p1077 -(lp1078 -I400 -asVlevenshtein -p1079 -(lp1080 -I688 -asVgraphics -p1081 -(lp1082 -I160 -aI161 -aI162 -asVruby -p1083 -(lp1084 -I34 -aI35 -aI36 -aI37 -aI81 -asVmulti -p1085 -(lp1086 -I322 -asVexponential -p1087 -(lp1088 -I712 -asVtetrahedron -p1089 -(lp1090 -I664 -asVrat -p1091 -(lp1092 -I804 -asVvalue -p1093 -(lp1094 -I475 -asVremaining -p1095 -(lp1096 -I323 -asVrope -p1097 -(lp1098 -I609 -asVfunctional-patterns -p1099 -(lp1100 -I310 -asVbalance -p1101 -(lp1102 -I597 -asVrobin -p1103 -(lp1104 -I324 -aI325 -aI325 -asVpack -p1105 -(lp1106 -I6 -asVdemo -p1107 -(lp1108 -I288 -asVvon -p1109 -(lp1110 -I146 -asVavl -p1111 -(lp1112 -I610 -asVevening -p1113 -(lp1114 -I302 -aI303 -asVin -p1115 -(lp1116 -I248 -aI256 -aI334 -aI401 -aI415 -aI804 -aI812 -asVfacade -p1117 -(lp1118 -I295 -aI296 -asVregression -p1119 -(lp1120 -I762 -aI772 -asVbinary -p1121 -(lp1122 -I196 -aI237 -aI462 -aI468 -aI538 -aI539 -aI539 -aI540 -aI541 -aI542 -aI581 -aI582 -aI583 -aI583 -aI584 -aI591 -aI592 -aI592 -aI593 -aI594 -aI596 -aI597 -aI598 -aI599 -aI600 -aI600 -aI601 -aI602 -aI603 -aI604 -aI605 -aI606 -aI607 -aI608 -aI609 -aI610 -aI711 -asVfleury -p1123 -(lp1124 -I267 -asVdescent -p1125 -(lp1126 -I420 -asVdilate -p1127 -(lp1128 -I788 -asVgraham -p1129 -(lp1130 -I676 -asVfractals -p1131 -(lp1132 -I422 -asVroman -p1133 -(lp1134 -I354 -asVsqrt -p1135 -(lp1136 -I364 -asVfactorial -p1137 -(lp1138 -I214 -aI343 -aI360 -aI427 -aI505 -asVrot13 -p1139 -(lp1140 -I445 -asVcanny -p1141 -(lp1142 -I784 -asVsplit -p1143 -(lp1144 -I122 -asVrunge -p1145 -(lp1146 -I276 -aI277 -asVlargest -p1147 -(lp1148 -I208 -asVparty -p1149 -(lp1150 -I22 -aI23 -asVfinite -p1151 -(lp1152 -I431 -aI432 -aI685 -aI686 -asVinterpolation -p1153 -(lp1154 -I709 -asVindependent -p1155 -(lp1156 -I193 -aI194 -asVleftist -p1157 -(lp1158 -I573 -asVused -p1159 -(lp1160 -I328 -asVclosest -p1161 -(lp1162 -I502 -asVnim -p1163 -(lp1164 -I750 -aI752 -asVassignment -p1165 -(lp1166 -I225 -asVnumerical -p1167 -(lp1168 -I271 -aI272 -aI274 -aI276 -asVrail -p1169 -(lp1170 -I453 -asVtriangulation -p1171 -(lp1172 -I202 -asV002 -p1173 -(lp1174 -I717 -asV001 -p1175 -(lp1176 -I728 -asVedges -p1177 -(lp1178 -I258 -asV007 -p1179 -(lp1180 -I730 -asV006 -p1181 -(lp1182 -I723 -asV005 -p1183 -(lp1184 -I738 -asVvigenere -p1185 -(lp1186 -I439 -asVclimbing -p1187 -(lp1188 -I376 -asVvalidate -p1189 -(lp1190 -I655 -asVphp -p1191 -(lp1192 -I79 -asVeulerian -p1193 -(lp1194 -I224 -asVcycle -p1195 -(lp1196 -I235 -aI244 -aI261 -aI530 -aI560 -asV025 -p1197 -(lp1198 -I732 -asVfourier -p1199 -(lp1200 -I426 -asVlucas -p1201 -(lp1202 -I363 -asV024 -p1203 -(lp1204 -I724 -asVbuilder -p1205 -(lp1206 -I308 -aI309 -aI309 -aI311 -asVlapindrom -p1207 -(lp1208 -I115 -asVanalysis -p1209 -(lp1210 -I271 -aI272 -aI274 -aI276 -aI791 -asVdouble -p1211 -(lp1212 -I642 -asVpatterns -p1213 -(lp1214 -I283 -aI284 -aI285 -aI291 -aI292 -aI295 -aI304 -aI306 -aI308 -asVedge -p1215 -(lp1216 -I243 -asVsolve -p1217 -(lp1218 -I803 -asVgreatest -p1219 -(lp1220 -I401 -asVcomponents -p1221 -(lp1222 -I245 -aI260 -aI268 -aI270 -asVrunningkey -p1223 -(lp1224 -I451 -asV021 -p1225 -(lp1226 -I725 -asVthe -p1227 -(lp1228 -I120 -asVleft -p1229 -(lp1230 -I120 -aI237 -aI586 -aI595 -asVtarjan -p1231 -(lp1232 -I268 -asVstooge -p1233 -(lp1234 -I529 -asVnewton -p1235 -(lp1236 -I390 -aI407 -asVisodata -p1237 -(lp1238 -I776 -asVsobelfilter -p1239 -(lp1240 -I783 -asVlossy -p1241 -(lp1242 -I491 -asVinteger -p1243 -(lp1244 -I354 -aI396 -aI461 -asVhuffman -p1245 -(lp1246 -I134 -aI449 -aI486 -aI490 -asVguides -p1247 -(lp1248 -I24 -aI25 -aI25 -aI26 -aI30 -aI34 -aI38 -aI42 -aI46 -aI48 -aI52 -aI56 -aI60 -aI64 -aI68 -aI72 -aI76 -asVdivide -p1249 -(lp1250 -I492 -aI493 -aI494 -aI495 -aI496 -aI496 -aI497 -aI498 -aI499 -aI500 -aI501 -aI502 -aI503 -aI504 -aI505 -asVcut -p1251 -(lp1252 -I157 -aI220 -aI227 -aI253 -asVdining -p1253 -(lp1254 -I331 -asVadd -p1255 -(lp1256 -I398 -asVtheorem -p1257 -(lp1258 -I363 -aI423 -asVinput -p1259 -(lp1260 -I96 -asVtransformation -p1261 -(lp1262 -I217 -aI252 -asVeuler -p1263 -(lp1264 -I267 -aI391 -aI716 -aI717 -aI718 -aI719 -aI720 -aI721 -aI722 -aI723 -aI724 -aI725 -aI726 -aI727 -aI728 -aI729 -aI730 -aI731 -aI732 -aI733 -aI734 -aI735 -aI736 -aI737 -aI738 -aI739 -aI740 -aI741 -aI742 -aI743 -aI744 -aI745 -asVtests -p1265 -(lp1266 -I94 -aI95 -aI96 -aI350 -aI351 -aI352 -aI353 -asVmarch -p1267 -(lp1268 -I672 -asVchecking -p1269 -(lp1270 -I236 -asVcatalan -p1271 -(lp1272 -I369 -asVgame -p1273 -(lp1274 -I145 -aI748 -aI749 -aI750 -aI750 -aI751 -aI752 -aI752 -asVrotate -p1275 -(lp1276 -I562 -asVsequencing -p1277 -(lp1278 -I136 -asVfalcon -p1279 -(lp1280 -I0 -asVuncrustify -p1281 -(lp1282 -I23 -aI94 -aI95 -aI96 -asVunique -p1283 -(lp1284 -I113 -aI464 -aI474 -asVbabylonian -p1285 -(lp1286 -I411 -asVloss -p1287 -(lp1288 -I750 -asVsorting -p1289 -(lp1290 -I506 -aI507 -aI508 -aI509 -aI510 -aI511 -aI512 -aI513 -aI514 -aI515 -aI516 -aI517 -aI518 -aI519 -aI520 -aI521 -aI522 -aI523 -aI524 -aI525 -aI526 -aI527 -aI528 -aI529 -aI530 -aI531 -aI532 -aI533 -asVedit -p1291 -(lp1292 -I190 -asVboolean -p1293 -(lp1294 -I182 -asVt -p1295 -(lp1296 -I227 -aI777 -asVoutput -p1297 -(lp1298 -I95 -asVtower -p1299 -(lp1300 -I346 -asVsoft -p1301 -(lp1302 -I571 -asVpythagorean -p1303 -(lp1304 -I404 -asVmathematical -p1305 -(lp1306 -I338 -aI339 -aI340 -aI341 -aI342 -aI343 -aI344 -aI345 -aI346 -aI347 -aI348 -aI349 -aI350 -aI354 -aI355 -aI356 -aI357 -aI358 -aI359 -aI360 -aI361 -aI362 -aI363 -aI364 -aI365 -aI366 -aI367 -aI368 -aI369 -aI370 -aI371 -aI372 -aI373 -aI374 -aI375 -aI376 -aI377 -aI378 -aI387 -aI388 -aI389 -aI390 -aI391 -aI392 -aI393 -aI395 -aI396 -aI397 -aI398 -aI399 -aI400 -aI401 -aI402 -aI403 -aI404 -aI405 -aI406 -aI407 -aI408 -aI409 -aI410 -aI411 -aI412 -aI413 -aI414 -aI415 -aI416 -aI417 -aI418 -aI419 -aI420 -aI421 -aI422 -aI423 -aI424 -aI425 -aI426 -aI427 -aI428 -asVclipping -p1307 -(lp1308 -I665 -asVright -p1309 -(lp1310 -I587 -aI589 -asVneumann -p1311 -(lp1312 -I146 -asVsequence -p1313 -(lp1314 -I187 -aI201 -aI770 -aI771 -asVhalfplane -p1315 -(lp1316 -I670 -asVmirror -p1317 -(lp1318 -I606 -asVhierachical-clustering -p1319 -(lp1320 -I792 -asVmatching -p1321 -(lp1322 -I223 -aI229 -asVamicable -p1323 -(lp1324 -I425 -asVwarnock -p1325 -(lp1326 -I497 -asVnondeterministic -p1327 -(lp1328 -I431 -asVfor -p1329 -(lp1330 -I333 -aI334 -asVscala -p1331 -(lp1332 -I379 -aI380 -aI381 -aI382 -aI383 -aI385 -aI386 -asVdecision -p1333 -(lp1334 -I760 -asVjaccard -p1335 -(lp1336 -I110 -asV.github -p1337 -(lp1338 -I20 -asVleap -p1339 -(lp1340 -I111 -asVdecomposition -p1341 -(lp1342 -I250 -aI795 -aI796 -aI797 -aI798 -asVkmp -p1343 -(lp1344 -I700 -asVhoughtransform -p1345 -(lp1346 -I785 -asVshaker -p1347 -(lp1348 -I528 -asVpower -p1349 -(lp1350 -I393 -aI394 -aI476 -aI501 -asVtour -p1351 -(lp1352 -I805 -asVkruskal -p1353 -(lp1354 -I125 -aI131 -aI228 -asVprocessing -p1355 -(lp1356 -I781 -aI782 -aI783 -aI784 -aI785 -aI786 -aI788 -asVbinomial -p1357 -(lp1358 -I183 -aI345 -aI575 -asVelixir -p1359 -(lp1360 -I26 -aI27 -aI28 -aI29 -aI78 -asVanagram -p1361 -(lp1362 -I691 -asVfermat -p1363 -(lp1364 -I352 -asVby -p1365 -(lp1366 -I394 -asV040 -p1367 -(lp1368 -I744 -asVon -p1369 -(lp1370 -I687 -asVgnome -p1371 -(lp1372 -I513 -asVof -p1373 -(lp1374 -I106 -aI145 -aI194 -aI234 -aI343 -aI344 -aI346 -aI357 -aI362 -aI365 -aI368 -aI405 -aI429 -aI430 -aI431 -aI432 -aI476 -aI502 -aI662 -aI669 -aI750 -aI752 -aI807 -aI809 -aI812 -aI814 -asVunclassified -p1375 -(lp1376 -I100 -aI101 -aI102 -aI103 -aI104 -aI105 -aI106 -aI107 -aI108 -aI109 -aI110 -aI111 -aI112 -aI113 -aI114 -aI115 -aI116 -aI117 -aI118 -aI119 -aI120 -aI121 -aI122 -aI556 -asVstrassen -p1377 -(lp1378 -I500 -asVneighbor -p1379 -(lp1380 -I777 -asVtransitive -p1381 -(lp1382 -I226 -asVcoins -p1383 -(lp1384 -I132 -asVnsm -p1385 -(lp1386 -I771 -asVconway -p1387 -(lp1388 -I359 -asVpuzzle -p1389 -(lp1390 -I121 -aI192 -aI802 -asVintegral -p1391 -(lp1392 -I272 -aI273 -asVcpp -p1393 -(lp1394 -I637 -aI638 -asVhopcroft -p1395 -(lp1396 -I221 -asVpair -p1397 -(lp1398 -I502 -asVweighted -p1399 -(lp1400 -I195 -asVdetermine -p1401 -(lp1402 -I658 -asVelementary -p1403 -(lp1404 -I144 -asVnext -p1405 -(lp1406 -I355 -aI752 -asVutility -p1407 -(lp1408 -I167 -aI168 -aI169 -aI171 -aI172 -asVclustering -p1409 -(lp1410 -I756 -aI776 -asVvan -p1411 -(lp1412 -I580 -aI612 -asVlog -p1413 -(lp1414 -I343 -asVarea -p1415 -(lp1416 -I662 -aI669 -asVsegment -p1417 -(lp1418 -I624 -aI626 -asVsupport -p1419 -(lp1420 -I769 -asVpairing -p1421 -(lp1422 -I570 -asVspiral -p1423 -(lp1424 -I102 -aI114 -asVfast -p1425 -(lp1426 -I364 -aI426 -asVlonely -p1427 -(lp1428 -I461 -asVfraction -p1429 -(lp1430 -I138 -asVconways -p1431 -(lp1432 -I145 -asVbiggest -p1433 -(lp1434 -I106 -aI112 -asVmaze -p1435 -(lp1436 -I804 -aI812 -asVbubble -p1437 -(lp1438 -I520 -asVeratosthenes -p1439 -(lp1440 -I362 -aI365 -asVatkin -p1441 -(lp1442 -I357 -asVdifferences -p1443 -(lp1444 -I414 -asVford -p1445 -(lp1446 -I219 -aI251 -asVphilosophers -p1447 -(lp1448 -I331 -asVbayes -p1449 -(lp1450 -I761 -aI768 -asVended -p1451 -(lp1452 -I642 -asVheap -p1453 -(lp1454 -I518 -aI569 -aI570 -aI570 -aI571 -aI571 -aI572 -aI574 -aI574 -aI575 -aI575 -aI576 -aI576 -asVelimination -p1455 -(lp1456 -I378 -aI379 -aI384 -asVline -p1457 -(lp1458 -I668 -aI673 -asVwith -p1459 -(lp1460 -I107 -aI374 -asVcount -p1461 -(lp1462 -I234 -aI348 -aI372 -aI473 -aI499 -asVpartitioning -p1463 -(lp1464 -I621 -aI622 -aI623 -aI624 -aI625 -asVbucket -p1465 -(lp1466 -I515 -asVmaximum -p1467 -(lp1468 -I180 -aI184 -aI194 -aI219 -aI223 -aI229 -aI243 -aI246 -aI475 -aI495 -aI598 -asVkuhn -p1469 -(lp1470 -I223 -asVsteepest -p1471 -(lp1472 -I420 -asVhorner -p1473 -(lp1474 -I389 -asVcosmos -p1475 -(lp1476 -I0 -aI1 -aI2 -aI3 -aI20 -aI21 -aI22 -aI24 -aI99 -asVz -p1477 -(lp1478 -I694 -asVrust -p1479 -(lp1480 -I48 -aI49 -aI50 -aI51 -aI87 -asVdelete -p1481 -(lp1482 -I565 -asVstrongly -p1483 -(lp1484 -I260 -aI268 -asVzeroes -p1485 -(lp1486 -I372 -asVinterval -p1487 -(lp1488 -I623 -asVmoore -p1489 -(lp1490 -I701 -asVarmstrong -p1491 -(lp1492 -I428 -asVtrie -p1493 -(lp1494 -I579 -aI683 -asVflow -p1495 -(lp1496 -I219 -aI246 -asVabstract -p1497 -(lp1498 -I636 -aI637 -asVtournament -p1499 -(lp1500 -I498 -asVlineclip -p1501 -(lp1502 -I674 -asVsingly -p1503 -(lp1504 -I554 -aI555 -asVan -p1505 -(lp1506 -I154 -asVautoenncoder -p1507 -(lp1508 -I765 -asVintro -p1509 -(lp1510 -I527 -asVrule -p1511 -(lp1512 -I377 -asVpip -p1513 -(lp1514 -I46 -aI47 -asVtiling -p1515 -(lp1516 -I197 -asVtrailing -p1517 -(lp1518 -I372 -asVcheck -p1519 -(lp1520 -I170 -aI173 -aI222 -aI418 -asVfill -p1521 -(lp1522 -I109 -asVmutual -p1523 -(lp1524 -I333 -aI334 -asVparadox -p1525 -(lp1526 -I156 -asVpolygon -p1527 -(lp1528 -I202 -aI669 -asVno -p1529 -(lp1530 -I116 -aI207 -asVfenwick -p1531 -(lp1532 -I616 -asVforests -p1533 -(lp1534 -I789 -asVvirtual -p1535 -(lp1536 -I286 -aI287 -asVother -p1537 -(lp1538 -I651 -asV5 -p1539 -(lp1540 -I374 -asVdigital -p1541 -(lp1542 -I448 -asVtest -p1543 -(lp1544 -I351 -aI352 -aI353 -aI671 -asVarithmetic -p1545 -(lp1546 -I687 -asVnode -p1547 -(lp1548 -I159 -aI563 -aI599 -asVstar -p1549 -(lp1550 -I778 -asVpalindromic -p1551 -(lp1552 -I186 -aI187 -asVkerbosch -p1553 -(lp1554 -I264 -asVvertex -p1555 -(lp1556 -I241 -asVutilities -p1557 -(lp1558 -I118 -asVpolynomials -p1559 -(lp1560 -I398 -asVgifts -p1561 -(lp1562 -I307 -asVpush -p1563 -(lp1564 -I557 -asVunion -p1565 -(lp1566 -I545 -aI614 -asVmatrix -p1567 -(lp1568 -I184 -aI211 -aI217 -aI239 -aI252 -aI424 -aI500 -asVsudoku -p1569 -(lp1570 -I803 -asVlcm -p1571 -(lp1572 -I347 -asValgorithm -p1573 -(lp1574 -I147 -aI152 -aI157 -aI221 -aI233 -aI242 -aI251 -aI264 -aI265 -aI267 -aI268 -aI317 -aI333 -aI334 -aI334 -aI497 -aI666 -aI682 -aI690 -aI694 -aI696 -aI698 -aI700 -aI701 -aI798 -asVbottom -p1575 -(lp1576 -I604 -asVbankers -p1577 -(lp1578 -I317 -asVdaily -p1579 -(lp1580 -I296 -aI297 -asVdepth -p1581 -(lp1582 -I263 -asVsegmented -p1583 -(lp1584 -I362 -asVternary -p1585 -(lp1586 -I705 -asVtime -p1587 -(lp1588 -I323 -aI326 -asVdinic -p1589 -(lp1590 -I246 -asVhillclimber -p1591 -(lp1592 -I129 -asVminimax -p1593 -(lp1594 -I774 -asVserializer -p1595 -(lp1596 -I607 -as. \ No newline at end of file diff --git a/build/lib/dumps/category.json b/build/lib/dumps/category.json deleted file mode 100755 index 7984054..0000000 --- a/build/lib/dumps/category.json +++ /dev/null @@ -1 +0,0 @@ -[{"category": "cosmos", "description": "falcon cosmos", "location": ""}, {"category": "test", "description": "cosmos", "location": "/test"}, {"category": "c++", "description": "cosmos c++", "location": "/test/c++"}, {"category": ".git", "description": "cosmos .git", "location": "/.git"}, {"category": "objects", "description": ".git objects", "location": "/.git/objects"}, {"category": "info", "description": "objects info", "location": "/.git/objects/info"}, {"category": "pack", "description": "objects pack", "location": "/.git/objects/pack"}, {"category": "hooks", "description": ".git hooks", "location": "/.git/hooks"}, {"category": "refs", "description": ".git refs", "location": "/.git/refs"}, {"category": "remotes", "description": "refs remotes", "location": "/.git/refs/remotes"}, {"category": "origin", "description": "remotes origin", "location": "/.git/refs/remotes/origin"}, {"category": "tags", "description": "refs tags", "location": "/.git/refs/tags"}, {"category": "heads", "description": "refs heads", "location": "/.git/refs/heads"}, {"category": "branches", "description": ".git branches", "location": "/.git/branches"}, {"category": "info", "description": ".git info", "location": "/.git/info"}, {"category": "logs", "description": ".git logs", "location": "/.git/logs"}, {"category": "refs", "description": "logs refs", "location": "/.git/logs/refs"}, {"category": "remotes", "description": "refs remotes", "location": "/.git/logs/refs/remotes"}, {"category": "origin", "description": "remotes origin", "location": "/.git/logs/refs/remotes/origin"}, {"category": "heads", "description": "refs heads", "location": "/.git/logs/refs/heads"}, {"category": ".github", "description": "cosmos .github", "location": "/.github"}, {"category": "scripts", "description": "cosmos scripts", "location": "/scripts"}, {"category": "third party", "description": "cosmos third party", "location": "/third_party"}, {"category": "uncrustify", "description": "third party uncrustify", "location": "/third_party/uncrustify"}, {"category": "guides", "description": "cosmos guides", "location": "/guides"}, {"category": "installation guides", "description": "guides installation guides", "location": "/guides/installation_guides"}, {"category": "elixir", "description": "installation guides elixir", "location": "/guides/installation_guides/elixir"}, {"category": "linux", "description": "elixir linux", "location": "/guides/installation_guides/elixir/linux"}, {"category": "mac", "description": "elixir mac", "location": "/guides/installation_guides/elixir/mac"}, {"category": "windows", "description": "elixir windows", "location": "/guides/installation_guides/elixir/windows"}, {"category": "kotlin", "description": "installation guides kotlin", "location": "/guides/installation_guides/kotlin"}, {"category": "linux", "description": "kotlin linux", "location": "/guides/installation_guides/kotlin/linux"}, {"category": "mac", "description": "kotlin mac", "location": "/guides/installation_guides/kotlin/mac"}, {"category": "windows", "description": "kotlin windows", "location": "/guides/installation_guides/kotlin/windows"}, {"category": "ruby", "description": "installation guides ruby", "location": "/guides/installation_guides/ruby"}, {"category": "linux", "description": "ruby linux", "location": "/guides/installation_guides/ruby/linux"}, {"category": "mac", "description": "ruby mac", "location": "/guides/installation_guides/ruby/mac"}, {"category": "windows", "description": "ruby windows", "location": "/guides/installation_guides/ruby/windows"}, {"category": "c", "description": "installation guides c", "location": "/guides/installation_guides/c"}, {"category": "linux", "description": "c linux", "location": "/guides/installation_guides/c/linux"}, {"category": "mac", "description": "c mac", "location": "/guides/installation_guides/c/mac"}, {"category": "windows", "description": "c windows", "location": "/guides/installation_guides/c/windows"}, {"category": "python", "description": "installation guides python", "location": "/guides/installation_guides/python"}, {"category": "linux", "description": "python linux", "location": "/guides/installation_guides/python/linux"}, {"category": "mac", "description": "python mac", "location": "/guides/installation_guides/python/mac"}, {"category": "windows", "description": "python windows", "location": "/guides/installation_guides/python/windows"}, {"category": "python pip", "description": "installation guides python pip", "location": "/guides/installation_guides/python_pip"}, {"category": "linux", "description": "python pip linux", "location": "/guides/installation_guides/python_pip/linux"}, {"category": "rust", "description": "installation guides rust", "location": "/guides/installation_guides/rust"}, {"category": "linux", "description": "rust linux", "location": "/guides/installation_guides/rust/linux"}, {"category": "mac", "description": "rust mac", "location": "/guides/installation_guides/rust/mac"}, {"category": "windows", "description": "rust windows", "location": "/guides/installation_guides/rust/windows"}, {"category": "swift", "description": "installation guides swift", "location": "/guides/installation_guides/swift"}, {"category": "linux", "description": "swift linux", "location": "/guides/installation_guides/swift/linux"}, {"category": "mac", "description": "swift mac", "location": "/guides/installation_guides/swift/mac"}, {"category": "windows", "description": "swift windows", "location": "/guides/installation_guides/swift/windows"}, {"category": "javascript", "description": "installation guides javascript", "location": "/guides/installation_guides/javascript"}, {"category": "linux", "description": "javascript linux", "location": "/guides/installation_guides/javascript/linux"}, {"category": "mac", "description": "javascript mac", "location": "/guides/installation_guides/javascript/mac"}, {"category": "windows", "description": "javascript windows", "location": "/guides/installation_guides/javascript/windows"}, {"category": "java", "description": "installation guides java", "location": "/guides/installation_guides/java"}, {"category": "linux", "description": "java linux", "location": "/guides/installation_guides/java/linux"}, {"category": "mac", "description": "java mac", "location": "/guides/installation_guides/java/mac"}, {"category": "windows", "description": "java windows", "location": "/guides/installation_guides/java/windows"}, {"category": "c++", "description": "installation guides c++", "location": "/guides/installation_guides/c++"}, {"category": "linux", "description": "c++ linux", "location": "/guides/installation_guides/c++/linux"}, {"category": "mac", "description": "c++ mac", "location": "/guides/installation_guides/c++/mac"}, {"category": "windows", "description": "c++ windows", "location": "/guides/installation_guides/c++/windows"}, {"category": "go", "description": "installation guides go", "location": "/guides/installation_guides/go"}, {"category": "linux", "description": "go linux", "location": "/guides/installation_guides/go/linux"}, {"category": "mac", "description": "go mac", "location": "/guides/installation_guides/go/mac"}, {"category": "windows", "description": "go windows", "location": "/guides/installation_guides/go/windows"}, {"category": "pascal", "description": "installation guides pascal", "location": "/guides/installation_guides/pascal"}, {"category": "linux", "description": "pascal linux", "location": "/guides/installation_guides/pascal/linux"}, {"category": "mac", "description": "pascal mac", "location": "/guides/installation_guides/pascal/mac"}, {"category": "windows", "description": "pascal windows", "location": "/guides/installation_guides/pascal/windows"}, {"category": "coding style", "description": "guides coding style", "location": "/guides/coding_style"}, {"category": "typescript", "description": "coding style typescript", "location": "/guides/coding_style/typescript"}, {"category": "elixir", "description": "coding style elixir", "location": "/guides/coding_style/elixir"}, {"category": "php", "description": "coding style php", "location": "/guides/coding_style/php"}, {"category": "kotlin", "description": "coding style kotlin", "location": "/guides/coding_style/kotlin"}, {"category": "ruby", "description": "coding style ruby", "location": "/guides/coding_style/ruby"}, {"category": "ml", "description": "coding style ml", "location": "/guides/coding_style/ml"}, {"category": "perl", "description": "coding style perl", "location": "/guides/coding_style/perl"}, {"category": "f#", "description": "coding style f#", "location": "/guides/coding_style/f#"}, {"category": "c", "description": "coding style c", "location": "/guides/coding_style/c"}, {"category": "python", "description": "coding style python", "location": "/guides/coding_style/python"}, {"category": "rust", "description": "coding style rust", "location": "/guides/coding_style/rust"}, {"category": "lisp", "description": "coding style lisp", "location": "/guides/coding_style/lisp"}, {"category": "c#", "description": "coding style c#", "location": "/guides/coding_style/c#"}, {"category": "swift", "description": "coding style swift", "location": "/guides/coding_style/swift"}, {"category": "javascript", "description": "coding style javascript", "location": "/guides/coding_style/javascript"}, {"category": "java", "description": "coding style java", "location": "/guides/coding_style/java"}, {"category": "c++", "description": "coding style c++", "location": "/guides/coding_style/c++"}, {"category": "uncrustify tests", "description": "c++ uncrustify tests", "location": "/guides/coding_style/c++/uncrustify_tests"}, {"category": "output", "description": "uncrustify tests output", "location": "/guides/coding_style/c++/uncrustify_tests/output"}, {"category": "input", "description": "uncrustify tests input", "location": "/guides/coding_style/c++/uncrustify_tests/input"}, {"category": "go", "description": "coding style go", "location": "/guides/coding_style/go"}, {"category": "pascal", "description": "coding style pascal", "location": "/guides/coding_style/pascal"}, {"category": "code", "description": "cosmos code", "location": "/code"}, {"category": "unclassified", "description": "code unclassified", "location": "/code/unclassified"}, {"category": "test", "description": "unclassified", "location": "/code/unclassified/test"}, {"category": "spiral printing", "description": "unclassified spiral printing", "location": "/code/unclassified/test/spiral_printing"}, {"category": "src", "description": "unclassified", "location": "/code/unclassified/src"}, {"category": "majority element", "description": "unclassified majority element", "location": "/code/unclassified/src/majority_element"}, {"category": "tokenizer", "description": "unclassified tokenizer", "location": "/code/unclassified/src/tokenizer"}, {"category": "biggest of n numbers", "description": "unclassified biggest of n numbers", "location": "/code/unclassified/src/biggest_of_n_numbers"}, {"category": "minimum subarray size with degree", "description": "unclassified minimum subarray size with degree", "location": "/code/unclassified/src/minimum_subarray_size_with_degree"}, {"category": "josephus problem", "description": "unclassified josephus problem", "location": "/code/unclassified/src/josephus_problem"}, {"category": "paint fill", "description": "unclassified paint fill", "location": "/code/unclassified/src/paint_fill"}, {"category": "jaccard similarity", "description": "unclassified jaccard similarity", "location": "/code/unclassified/src/jaccard_similarity"}, {"category": "leap year", "description": "unclassified leap year", "location": "/code/unclassified/src/leap_year"}, {"category": "biggest suffix", "description": "unclassified biggest suffix", "location": "/code/unclassified/src/biggest_suffix"}, {"category": "unique number", "description": "unclassified unique number", "location": "/code/unclassified/src/unique_number"}, {"category": "spiral print", "description": "unclassified spiral print", "location": "/code/unclassified/src/spiral_print"}, {"category": "lapindrom checker", "description": "unclassified lapindrom checker", "location": "/code/unclassified/src/lapindrom_checker"}, {"category": "no operator addition", "description": "unclassified no operator addition", "location": "/code/unclassified/src/no_operator_addition"}, {"category": "average", "description": "unclassified average", "location": "/code/unclassified/src/average"}, {"category": "utilities", "description": "unclassified utilities", "location": "/code/unclassified/src/utilities"}, {"category": "magic square", "description": "unclassified magic square", "location": "/code/unclassified/src/magic_square"}, {"category": "smallest number to the left", "description": "unclassified smallest number to the left", "location": "/code/unclassified/src/smallest_number_to_the_left"}, {"category": "fifteen puzzle", "description": "unclassified fifteen puzzle", "location": "/code/unclassified/src/fifteen_puzzle"}, {"category": "split list", "description": "unclassified split list", "location": "/code/unclassified/src/split_list"}, {"category": "greedy algorithms", "description": "code greedy algorithms", "location": "/code/greedy_algorithms"}, {"category": "test", "description": "greedy algorithms", "location": "/code/greedy_algorithms/test"}, {"category": "kruskal minimum spanning tree", "description": "greedy algorithms kruskal minimum spanning tree", "location": "/code/greedy_algorithms/test/kruskal_minimum_spanning_tree"}, {"category": "src", "description": "greedy algorithms", "location": "/code/greedy_algorithms/src"}, {"category": "fractional knapsack", "description": "greedy algorithms fractional knapsack", "location": "/code/greedy_algorithms/src/fractional_knapsack"}, {"category": "activity selection", "description": "greedy algorithms activity selection", "location": "/code/greedy_algorithms/src/activity_selection"}, {"category": "hillclimber", "description": "greedy algorithms hillclimber", "location": "/code/greedy_algorithms/src/hillclimber"}, {"category": "warshall", "description": "greedy algorithms warshall", "location": "/code/greedy_algorithms/src/warshall"}, {"category": "kruskal minimum spanning tree", "description": "greedy algorithms kruskal minimum spanning tree", "location": "/code/greedy_algorithms/src/kruskal_minimum_spanning_tree"}, {"category": "minimum coins", "description": "greedy algorithms minimum coins", "location": "/code/greedy_algorithms/src/minimum_coins"}, {"category": "prim minimum spanning tree", "description": "greedy algorithms prim minimum spanning tree", "location": "/code/greedy_algorithms/src/prim_minimum_spanning_tree"}, {"category": "huffman coding", "description": "greedy algorithms huffman coding", "location": "/code/greedy_algorithms/src/huffman_coding"}, {"category": "k centers", "description": "greedy algorithms k centers", "location": "/code/greedy_algorithms/src/k_centers"}, {"category": "job sequencing", "description": "greedy algorithms job sequencing", "location": "/code/greedy_algorithms/src/job_sequencing"}, {"category": "dijkstra shortest path", "description": "greedy algorithms dijkstra shortest path", "location": "/code/greedy_algorithms/src/dijkstra_shortest_path"}, {"category": "egyptian fraction", "description": "greedy algorithms egyptian fraction", "location": "/code/greedy_algorithms/src/egyptian_fraction"}, {"category": "cellular automaton", "description": "code cellular automaton", "location": "/code/cellular_automaton"}, {"category": "test", "description": "cellular automaton", "location": "/code/cellular_automaton/test"}, {"category": "src", "description": "cellular automaton", "location": "/code/cellular_automaton/src"}, {"category": "brians brain", "description": "cellular automaton brians brain", "location": "/code/cellular_automaton/src/brians_brain"}, {"category": "langtons ant", "description": "cellular automaton langtons ant", "location": "/code/cellular_automaton/src/langtons_ant"}, {"category": "elementary cellular automata", "description": "cellular automaton elementary cellular automata", "location": "/code/cellular_automaton/src/elementary_cellular_automata"}, {"category": "conways game of life", "description": "cellular automaton conways game of life", "location": "/code/cellular_automaton/src/conways_game_of_life"}, {"category": "von neumann cellular automata", "description": "cellular automaton von neumann cellular automata", "location": "/code/cellular_automaton/src/von_neumann_cellular_automata"}, {"category": "genetic algorithm", "description": "cellular automaton genetic algorithm", "location": "/code/cellular_automaton/src/genetic_algorithm"}, {"category": "nobili cellular automata", "description": "cellular automaton nobili cellular automata", "location": "/code/cellular_automaton/src/nobili_cellular_automata"}, {"category": "randomized algorithms", "description": "code randomized algorithms", "location": "/code/randomized_algorithms"}, {"category": "test", "description": "randomized algorithms", "location": "/code/randomized_algorithms/test"}, {"category": "src", "description": "randomized algorithms", "location": "/code/randomized_algorithms/src"}, {"category": "kth smallest element algorithm", "description": "randomized algorithms kth smallest element algorithm", "location": "/code/randomized_algorithms/src/kth_smallest_element_algorithm"}, {"category": "randomized quick sort", "description": "randomized algorithms randomized quick sort", "location": "/code/randomized_algorithms/src/randomized_quick_sort"}, {"category": "shuffle an array", "description": "randomized algorithms shuffle an array", "location": "/code/randomized_algorithms/src/shuffle_an_array"}, {"category": "random from stream", "description": "randomized algorithms random from stream", "location": "/code/randomized_algorithms/src/random_from_stream"}, {"category": "birthday paradox", "description": "randomized algorithms birthday paradox", "location": "/code/randomized_algorithms/src/birthday_paradox"}, {"category": "karger minimum cut algorithm", "description": "randomized algorithms karger minimum cut algorithm", "location": "/code/randomized_algorithms/src/karger_minimum_cut_algorithm"}, {"category": "reservoir sampling", "description": "randomized algorithms reservoir sampling", "location": "/code/randomized_algorithms/src/reservoir_sampling"}, {"category": "random node linkedlist", "description": "randomized algorithms random node linkedlist", "location": "/code/randomized_algorithms/src/random_node_linkedlist"}, {"category": "computer graphics", "description": "code computer graphics", "location": "/code/computer_graphics"}, {"category": "src", "description": "computer graphics", "location": "/code/computer_graphics/src"}, {"category": "diamond square", "description": "computer graphics diamond square", "location": "/code/computer_graphics/src/diamond_square"}, {"category": "selection algorithms", "description": "code selection algorithms", "location": "/code/selection_algorithms"}, {"category": "test", "description": "selection algorithms", "location": "/code/selection_algorithms/test"}, {"category": "src", "description": "selection algorithms", "location": "/code/selection_algorithms/src"}, {"category": "median-of-medians", "description": "selection algorithms median-of-medians", "location": "/code/selection_algorithms/src/median-of-medians"}, {"category": "utility", "description": "code utility", "location": "/code/utility"}, {"category": "test", "description": "utility", "location": "/code/utility/test"}, {"category": "palindrome", "description": "utility palindrome", "location": "/code/utility/test/palindrome"}, {"category": "palindrome check", "description": "palindrome palindrome check", "location": "/code/utility/test/palindrome/palindrome_check"}, {"category": "src", "description": "utility", "location": "/code/utility/src"}, {"category": "palindrome", "description": "utility palindrome", "location": "/code/utility/src/palindrome"}, {"category": "palindrome check", "description": "palindrome palindrome check", "location": "/code/utility/src/palindrome/palindrome_check"}, {"category": "dynamic programming", "description": "code dynamic programming", "location": "/code/dynamic_programming"}, {"category": "test", "description": "dynamic programming", "location": "/code/dynamic_programming/test"}, {"category": "longest repeating subsequence", "description": "dynamic programming longest repeating subsequence", "location": "/code/dynamic_programming/test/longest_repeating_subsequence"}, {"category": "subset sum", "description": "dynamic programming subset sum", "location": "/code/dynamic_programming/test/subset_sum"}, {"category": "src", "description": "dynamic programming", "location": "/code/dynamic_programming/src"}, {"category": "min cost path", "description": "dynamic programming min cost path", "location": "/code/dynamic_programming/src/min_cost_path"}, {"category": "maximum sum increasing subsequence", "description": "dynamic programming maximum sum increasing subsequence", "location": "/code/dynamic_programming/src/maximum_sum_increasing_subsequence"}, {"category": "palindrome partition", "description": "dynamic programming palindrome partition", "location": "/code/dynamic_programming/src/palindrome_partition"}, {"category": "boolean parenthesization", "description": "dynamic programming boolean parenthesization", "location": "/code/dynamic_programming/src/boolean_parenthesization"}, {"category": "binomial coefficient", "description": "dynamic programming binomial coefficient", "location": "/code/dynamic_programming/src/binomial_coefficient"}, {"category": "maximum sum sub matrix", "description": "dynamic programming maximum sum sub matrix", "location": "/code/dynamic_programming/src/maximum_sum_sub_matrix"}, {"category": "rod cutting", "description": "dynamic programming rod cutting", "location": "/code/dynamic_programming/src/rod_cutting"}, {"category": "longest palindromic substring", "description": "dynamic programming longest palindromic substring", "location": "/code/dynamic_programming/src/longest_palindromic_substring"}, {"category": "longest palindromic sequence", "description": "dynamic programming longest palindromic sequence", "location": "/code/dynamic_programming/src/longest_palindromic_sequence"}, {"category": "longest repeating subsequence", "description": "dynamic programming longest repeating subsequence", "location": "/code/dynamic_programming/src/longest_repeating_subsequence"}, {"category": "box stacking", "description": "dynamic programming box stacking", "location": "/code/dynamic_programming/src/box_stacking"}, {"category": "edit distance", "description": "dynamic programming edit distance", "location": "/code/dynamic_programming/src/edit_distance"}, {"category": "Array Median", "description": "dynamic programming Array Median", "location": "/code/dynamic_programming/src/Array_Median"}, {"category": "egg dropping puzzle", "description": "dynamic programming egg dropping puzzle", "location": "/code/dynamic_programming/src/egg_dropping_puzzle"}, {"category": "longest independent set", "description": "dynamic programming longest independent set", "location": "/code/dynamic_programming/src/longest_independent_set"}, {"category": "maximum weight independent set of path graph", "description": "dynamic programming maximum weight independent set of path graph", "location": "/code/dynamic_programming/src/maximum_weight_independent_set_of_path_graph"}, {"category": "weighted job scheduling", "description": "dynamic programming weighted job scheduling", "location": "/code/dynamic_programming/src/weighted_job_scheduling"}, {"category": "Optimal Binary Search Tree", "description": "dynamic programming Optimal Binary Search Tree", "location": "/code/dynamic_programming/src/Optimal_Binary_Search_Tree"}, {"category": "tiling problem", "description": "dynamic programming tiling problem", "location": "/code/dynamic_programming/src/tiling_problem"}, {"category": "longest common substring", "description": "dynamic programming longest common substring", "location": "/code/dynamic_programming/src/longest_common_substring"}, {"category": "longest increasing subsequence", "description": "dynamic programming longest increasing subsequence", "location": "/code/dynamic_programming/src/longest_increasing_subsequence"}, {"category": "shortest common supersequence", "description": "dynamic programming shortest common supersequence", "location": "/code/dynamic_programming/src/shortest_common_supersequence"}, {"category": "longest bitonic sequence", "description": "dynamic programming longest bitonic sequence", "location": "/code/dynamic_programming/src/longest_bitonic_sequence"}, {"category": "minimum cost polygon triangulation", "description": "dynamic programming minimum cost polygon triangulation", "location": "/code/dynamic_programming/src/minimum_cost_polygon_triangulation"}, {"category": "knapsack", "description": "dynamic programming knapsack", "location": "/code/dynamic_programming/src/knapsack"}, {"category": "subset sum", "description": "dynamic programming subset sum", "location": "/code/dynamic_programming/src/subset_sum"}, {"category": "coin change", "description": "dynamic programming coin change", "location": "/code/dynamic_programming/src/coin_change"}, {"category": "digit dp", "description": "dynamic programming digit dp", "location": "/code/dynamic_programming/src/digit_dp"}, {"category": "no consec ones", "description": "dynamic programming no consec ones", "location": "/code/dynamic_programming/src/no_consec_ones"}, {"category": "largest sum contiguous subarray", "description": "dynamic programming largest sum contiguous subarray", "location": "/code/dynamic_programming/src/largest_sum_contiguous_subarray"}, {"category": "longest common increasing subsequence", "description": "dynamic programming longest common increasing subsequence", "location": "/code/dynamic_programming/src/longest_common_increasing_subsequence"}, {"category": "minimum insertion palindrome", "description": "dynamic programming minimum insertion palindrome", "location": "/code/dynamic_programming/src/minimum_insertion_palindrome"}, {"category": "matrix chain multiplication", "description": "dynamic programming matrix chain multiplication", "location": "/code/dynamic_programming/src/matrix_chain_multiplication"}, {"category": "numeric keypad problem", "description": "dynamic programming numeric keypad problem", "location": "/code/dynamic_programming/src/numeric_keypad_problem"}, {"category": "longest common subsequence", "description": "dynamic programming longest common subsequence", "location": "/code/dynamic_programming/src/longest_common_subsequence"}, {"category": "factorial", "description": "dynamic programming factorial", "location": "/code/dynamic_programming/src/factorial"}, {"category": "graph algorithms", "description": "code graph algorithms", "location": "/code/graph_algorithms"}, {"category": "test", "description": "graph algorithms", "location": "/code/graph_algorithms/test"}, {"category": "matrix transformation", "description": "graph algorithms matrix transformation", "location": "/code/graph_algorithms/test/matrix_transformation"}, {"category": "src", "description": "graph algorithms", "location": "/code/graph_algorithms/src"}, {"category": "ford fulkerson maximum flow", "description": "graph algorithms ford fulkerson maximum flow", "location": "/code/graph_algorithms/src/ford_fulkerson_maximum_flow"}, {"category": "cut vertices", "description": "graph algorithms cut vertices", "location": "/code/graph_algorithms/src/cut_vertices"}, {"category": "hopcroft karp algorithm", "description": "graph algorithms hopcroft karp algorithm", "location": "/code/graph_algorithms/src/hopcroft_karp_algorithm"}, {"category": "Bipartite check", "description": "graph algorithms Bipartite check", "location": "/code/graph_algorithms/src/Bipartite_check"}, {"category": "kuhn maximum matching", "description": "graph algorithms kuhn maximum matching", "location": "/code/graph_algorithms/src/kuhn_maximum_matching"}, {"category": "eulerian path", "description": "graph algorithms eulerian path", "location": "/code/graph_algorithms/src/eulerian_path"}, {"category": "channel assignment", "description": "graph algorithms channel assignment", "location": "/code/graph_algorithms/src/channel_assignment"}, {"category": "transitive closure graph", "description": "graph algorithms transitive closure graph", "location": "/code/graph_algorithms/src/transitive_closure_graph"}, {"category": "minimum s t cut", "description": "graph algorithms minimum s t cut", "location": "/code/graph_algorithms/src/minimum_s_t_cut"}, {"category": "kruskal minimum spanning tree", "description": "graph algorithms kruskal minimum spanning tree", "location": "/code/graph_algorithms/src/kruskal_minimum_spanning_tree"}, {"category": "maximum bipartite matching", "description": "graph algorithms maximum bipartite matching", "location": "/code/graph_algorithms/src/maximum_bipartite_matching"}, {"category": "prim minimum spanning tree", "description": "graph algorithms prim minimum spanning tree", "location": "/code/graph_algorithms/src/prim_minimum_spanning_tree"}, {"category": "bridge tree", "description": "graph algorithms bridge tree", "location": "/code/graph_algorithms/src/bridge_tree"}, {"category": "travelling salesman mst", "description": "graph algorithms travelling salesman mst", "location": "/code/graph_algorithms/src/travelling_salesman_mst"}, {"category": "johnson algorithm shortest path", "description": "graph algorithms johnson algorithm shortest path", "location": "/code/graph_algorithms/src/johnson_algorithm_shortest_path"}, {"category": "count of ways n", "description": "graph algorithms count of ways n", "location": "/code/graph_algorithms/src/count_of_ways_n"}, {"category": "hamiltonian cycle", "description": "graph algorithms hamiltonian cycle", "location": "/code/graph_algorithms/src/hamiltonian_cycle"}, {"category": "bipartite checking", "description": "graph algorithms bipartite checking", "location": "/code/graph_algorithms/src/bipartite_checking"}, {"category": "left view binary tree", "description": "graph algorithms left view binary tree", "location": "/code/graph_algorithms/src/left_view_binary_tree"}, {"category": "data structures", "description": "graph algorithms data structures", "location": "/code/graph_algorithms/src/data_structures"}, {"category": "adjacency matrix C", "description": "data structures adjacency matrix C", "location": "/code/graph_algorithms/src/data_structures/adjacency_matrix_C"}, {"category": "breadth first search", "description": "graph algorithms breadth first search", "location": "/code/graph_algorithms/src/breadth_first_search"}, {"category": "vertex cover", "description": "graph algorithms vertex cover", "location": "/code/graph_algorithms/src/vertex_cover"}, {"category": "floyd warshall algorithm", "description": "graph algorithms floyd warshall algorithm", "location": "/code/graph_algorithms/src/floyd_warshall_algorithm"}, {"category": "maximum edge disjoint paths", "description": "graph algorithms maximum edge disjoint paths", "location": "/code/graph_algorithms/src/maximum_edge_disjoint_paths"}, {"category": "cycle undirected graph", "description": "graph algorithms cycle undirected graph", "location": "/code/graph_algorithms/src/cycle_undirected_graph"}, {"category": "biconnected components", "description": "graph algorithms biconnected components", "location": "/code/graph_algorithms/src/biconnected_components"}, {"category": "dinic maximum flow", "description": "graph algorithms dinic maximum flow", "location": "/code/graph_algorithms/src/dinic_maximum_flow"}, {"category": "dijkstra shortest path", "description": "graph algorithms dijkstra shortest path", "location": "/code/graph_algorithms/src/dijkstra_shortest_path"}, {"category": "bridges in graph", "description": "graph algorithms bridges in graph", "location": "/code/graph_algorithms/src/bridges_in_graph"}, {"category": "boruvka minimum spanning tree", "description": "graph algorithms boruvka minimum spanning tree", "location": "/code/graph_algorithms/src/boruvka_minimum_spanning_tree"}, {"category": "centroid decomposition", "description": "graph algorithms centroid decomposition", "location": "/code/graph_algorithms/src/centroid_decomposition"}, {"category": "bellman ford algorithm", "description": "graph algorithms bellman ford algorithm", "location": "/code/graph_algorithms/src/bellman_ford_algorithm"}, {"category": "matrix transformation", "description": "graph algorithms matrix transformation", "location": "/code/graph_algorithms/src/matrix_transformation"}, {"category": "karger minimum cut", "description": "graph algorithms karger minimum cut", "location": "/code/graph_algorithms/src/karger_minimum_cut"}, {"category": "graph coloring", "description": "graph algorithms graph coloring", "location": "/code/graph_algorithms/src/graph_coloring"}, {"category": "adjacency lists graph representation", "description": "graph algorithms adjacency lists graph representation", "location": "/code/graph_algorithms/src/adjacency_lists_graph_representation"}, {"category": "adjacency lists in C", "description": "adjacency lists graph representation adjacency lists in C", "location": "/code/graph_algorithms/src/adjacency_lists_graph_representation/adjacency_lists_in_C"}, {"category": "topological sort", "description": "graph algorithms topological sort", "location": "/code/graph_algorithms/src/topological_sort"}, {"category": "shortest path k edges", "description": "graph algorithms shortest path k edges", "location": "/code/graph_algorithms/src/shortest_path_k_edges"}, {"category": "postorder from inorder and preorder", "description": "graph algorithms postorder from inorder and preorder", "location": "/code/graph_algorithms/src/postorder_from_inorder_and_preorder"}, {"category": "strongly connected components", "description": "graph algorithms strongly connected components", "location": "/code/graph_algorithms/src/strongly_connected_components"}, {"category": "cycle directed graph", "description": "graph algorithms cycle directed graph", "location": "/code/graph_algorithms/src/cycle_directed_graph"}, {"category": "hamiltonian path", "description": "graph algorithms hamiltonian path", "location": "/code/graph_algorithms/src/hamiltonian_path"}, {"category": "depth first search", "description": "graph algorithms depth first search", "location": "/code/graph_algorithms/src/depth_first_search"}, {"category": "bron kerbosch algorithm", "description": "graph algorithms bron kerbosch algorithm", "location": "/code/graph_algorithms/src/bron_kerbosch_algorithm"}, {"category": "astar algorithm", "description": "graph algorithms astar algorithm", "location": "/code/graph_algorithms/src/astar_algorithm"}, {"category": "longest path directed acyclic graph", "description": "graph algorithms longest path directed acyclic graph", "location": "/code/graph_algorithms/src/longest_path_directed_acyclic_graph"}, {"category": "fleury algorithm euler path", "description": "graph algorithms fleury algorithm euler path", "location": "/code/graph_algorithms/src/fleury_algorithm_euler_path"}, {"category": "tarjan algorithm strongly connected components", "description": "graph algorithms tarjan algorithm strongly connected components", "location": "/code/graph_algorithms/src/tarjan_algorithm_strongly_connected_components"}, {"category": "steiner tree", "description": "graph algorithms steiner tree", "location": "/code/graph_algorithms/src/steiner_tree"}, {"category": "connected components", "description": "graph algorithms connected components", "location": "/code/graph_algorithms/src/connected_components"}, {"category": "numerical analysis", "description": "code numerical analysis", "location": "/code/numerical_analysis"}, {"category": "integral", "description": "numerical analysis integral", "location": "/code/numerical_analysis/integral"}, {"category": "src", "description": "integral", "location": "/code/numerical_analysis/integral/src"}, {"category": "monte carlo", "description": "numerical analysis monte carlo", "location": "/code/numerical_analysis/monte_carlo"}, {"category": "src", "description": "monte carlo", "location": "/code/numerical_analysis/monte_carlo/src"}, {"category": "runge kutt", "description": "numerical analysis runge kutt", "location": "/code/numerical_analysis/runge_kutt"}, {"category": "src", "description": "runge kutt", "location": "/code/numerical_analysis/runge_kutt/src"}, {"category": "design pattern", "description": "code design pattern", "location": "/code/design_pattern"}, {"category": "test", "description": "design pattern", "location": "/code/design_pattern/test"}, {"category": "src", "description": "design pattern", "location": "/code/design_pattern/src"}, {"category": "singleton pattern", "description": "design pattern singleton pattern", "location": "/code/design_pattern/src/singleton_pattern"}, {"category": "iterator pattern", "description": "design pattern iterator pattern", "location": "/code/design_pattern/src/iterator_pattern"}, {"category": "OOP patterns", "description": "design pattern OOP patterns", "location": "/code/design_pattern/src/OOP_patterns"}, {"category": "singleton pattern", "description": "OOP patterns singleton pattern", "location": "/code/design_pattern/src/OOP_patterns/singleton_pattern"}, {"category": "proxy", "description": "OOP patterns proxy", "location": "/code/design_pattern/src/OOP_patterns/proxy"}, {"category": "virtual", "description": "proxy virtual", "location": "/code/design_pattern/src/OOP_patterns/proxy/virtual"}, {"category": "proxy", "description": "virtual proxy", "location": "/code/design_pattern/src/OOP_patterns/proxy/virtual/proxy"}, {"category": "demo", "description": "proxy demo", "location": "/code/design_pattern/src/OOP_patterns/proxy/demo"}, {"category": "protection", "description": "proxy protection", "location": "/code/design_pattern/src/OOP_patterns/proxy/protection"}, {"category": "proxy", "description": "protection proxy", "location": "/code/design_pattern/src/OOP_patterns/proxy/protection/proxy"}, {"category": "observer pattern", "description": "OOP patterns observer pattern", "location": "/code/design_pattern/src/OOP_patterns/observer_pattern"}, {"category": "observer java", "description": "OOP patterns observer java", "location": "/code/design_pattern/src/OOP_patterns/observer_java"}, {"category": "observer", "description": "observer java observer", "location": "/code/design_pattern/src/OOP_patterns/observer_java/observer"}, {"category": "network", "description": "observer network", "location": "/code/design_pattern/src/OOP_patterns/observer_java/observer/network"}, {"category": "facade", "description": "OOP patterns facade", "location": "/code/design_pattern/src/OOP_patterns/facade"}, {"category": "daily", "description": "facade daily", "location": "/code/design_pattern/src/OOP_patterns/facade/daily"}, {"category": "tasks", "description": "daily tasks", "location": "/code/design_pattern/src/OOP_patterns/facade/daily/tasks"}, {"category": "gym", "description": "tasks gym", "location": "/code/design_pattern/src/OOP_patterns/facade/daily/tasks/gym"}, {"category": "morning", "description": "tasks morning", "location": "/code/design_pattern/src/OOP_patterns/facade/daily/tasks/morning"}, {"category": "routine", "description": "morning routine", "location": "/code/design_pattern/src/OOP_patterns/facade/daily/tasks/morning/routine"}, {"category": "job", "description": "tasks job", "location": "/code/design_pattern/src/OOP_patterns/facade/daily/tasks/job"}, {"category": "evening", "description": "tasks evening", "location": "/code/design_pattern/src/OOP_patterns/facade/daily/tasks/evening"}, {"category": "routine", "description": "evening routine", "location": "/code/design_pattern/src/OOP_patterns/facade/daily/tasks/evening/routine"}, {"category": "adapter", "description": "OOP patterns adapter", "location": "/code/design_pattern/src/OOP_patterns/adapter"}, {"category": "Soldiers", "description": "adapter Soldiers", "location": "/code/design_pattern/src/OOP_patterns/adapter/Soldiers"}, {"category": "factory", "description": "OOP patterns factory", "location": "/code/design_pattern/src/OOP_patterns/factory"}, {"category": "gifts", "description": "factory gifts", "location": "/code/design_pattern/src/OOP_patterns/factory/gifts"}, {"category": "builder", "description": "OOP patterns builder", "location": "/code/design_pattern/src/OOP_patterns/builder"}, {"category": "builder", "description": "builder builder", "location": "/code/design_pattern/src/OOP_patterns/builder/builder"}, {"category": "functional-patterns", "description": "design pattern functional-patterns", "location": "/code/design_pattern/src/functional-patterns"}, {"category": "builder pattern", "description": "design pattern builder pattern", "location": "/code/design_pattern/src/builder_pattern"}, {"category": "policy based design", "description": "design pattern policy based design", "location": "/code/design_pattern/src/policy_based_design"}, {"category": "operating system", "description": "code operating system", "location": "/code/operating_system"}, {"category": "test", "description": "operating system", "location": "/code/operating_system/test"}, {"category": "src", "description": "operating system", "location": "/code/operating_system/src"}, {"category": "deadlocks", "description": "operating system deadlocks", "location": "/code/operating_system/src/deadlocks"}, {"category": "bankers algorithm", "description": "deadlocks bankers algorithm", "location": "/code/operating_system/src/deadlocks/bankers_algorithm"}, {"category": "shell", "description": "operating system shell", "location": "/code/operating_system/src/shell"}, {"category": "C", "description": "shell C", "location": "/code/operating_system/src/shell/C"}, {"category": "scheduling", "description": "operating system scheduling", "location": "/code/operating_system/src/scheduling"}, {"category": "first come first serve", "description": "scheduling first come first serve", "location": "/code/operating_system/src/scheduling/first_come_first_serve"}, {"category": "multi level feedback queue scheduling", "description": "scheduling multi level feedback queue scheduling", "location": "/code/operating_system/src/scheduling/multi_level_feedback_queue_scheduling"}, {"category": "smallest remaining time first", "description": "scheduling smallest remaining time first", "location": "/code/operating_system/src/scheduling/smallest_remaining_time_first"}, {"category": "round robin scheduling", "description": "scheduling round robin scheduling", "location": "/code/operating_system/src/scheduling/round_robin_scheduling"}, {"category": "round robin c", "description": "round robin scheduling round robin c", "location": "/code/operating_system/src/scheduling/round_robin_scheduling/round_robin_c"}, {"category": "shortest seek time first", "description": "scheduling shortest seek time first", "location": "/code/operating_system/src/scheduling/shortest_seek_time_first"}, {"category": "memory management", "description": "operating system memory management", "location": "/code/operating_system/src/memory_management"}, {"category": "least recently used", "description": "memory management least recently used", "location": "/code/operating_system/src/memory_management/least_recently_used"}, {"category": "memory mapping", "description": "memory management memory mapping", "location": "/code/operating_system/src/memory_management/memory_mapping"}, {"category": "concurrency", "description": "operating system concurrency", "location": "/code/operating_system/src/concurrency"}, {"category": "dining philosophers", "description": "concurrency dining philosophers", "location": "/code/operating_system/src/concurrency/dining_philosophers"}, {"category": "readers writers", "description": "concurrency readers writers", "location": "/code/operating_system/src/concurrency/readers_writers"}, {"category": "peterson algorithm for mutual exclusion", "description": "concurrency peterson algorithm for mutual exclusion", "location": "/code/operating_system/src/concurrency/peterson_algorithm_for_mutual_exclusion"}, {"category": "peterson algorithm in c", "description": "peterson algorithm for mutual exclusion peterson algorithm in c", "location": "/code/operating_system/src/concurrency/peterson_algorithm_for_mutual_exclusion/peterson_algorithm_in_c"}, {"category": "monitors", "description": "concurrency monitors", "location": "/code/operating_system/src/concurrency/monitors"}, {"category": "monitors system v", "description": "monitors monitors system v", "location": "/code/operating_system/src/concurrency/monitors/monitors_system_v"}, {"category": "producer consumer", "description": "concurrency producer consumer", "location": "/code/operating_system/src/concurrency/producer_consumer"}, {"category": "mathematical algorithms", "description": "code mathematical algorithms", "location": "/code/mathematical_algorithms"}, {"category": "test", "description": "mathematical algorithms", "location": "/code/mathematical_algorithms/test"}, {"category": "src", "description": "mathematical algorithms", "location": "/code/mathematical_algorithms/src"}, {"category": "prime factors", "description": "mathematical algorithms prime factors", "location": "/code/mathematical_algorithms/src/prime_factors"}, {"category": "lexicographic string rank", "description": "mathematical algorithms lexicographic string rank", "location": "/code/mathematical_algorithms/src/lexicographic_string_rank"}, {"category": "log of factorial", "description": "mathematical algorithms log of factorial", "location": "/code/mathematical_algorithms/src/log_of_factorial"}, {"category": "sum of digits", "description": "mathematical algorithms sum of digits", "location": "/code/mathematical_algorithms/src/sum_of_digits"}, {"category": "binomial coefficient", "description": "mathematical algorithms binomial coefficient", "location": "/code/mathematical_algorithms/src/binomial_coefficient"}, {"category": "tower of hanoi", "description": "mathematical algorithms tower of hanoi", "location": "/code/mathematical_algorithms/src/tower_of_hanoi"}, {"category": "gcd and lcm", "description": "mathematical algorithms gcd and lcm", "location": "/code/mathematical_algorithms/src/gcd_and_lcm"}, {"category": "count digits", "description": "mathematical algorithms count digits", "location": "/code/mathematical_algorithms/src/count_digits"}, {"category": "fibonacci number", "description": "mathematical algorithms fibonacci number", "location": "/code/mathematical_algorithms/src/fibonacci_number"}, {"category": "primality tests", "description": "mathematical algorithms primality tests", "location": "/code/mathematical_algorithms/src/primality_tests"}, {"category": "miller rabin primality test", "description": "primality tests miller rabin primality test", "location": "/code/mathematical_algorithms/src/primality_tests/miller_rabin_primality_test"}, {"category": "fermat primality test", "description": "primality tests fermat primality test", "location": "/code/mathematical_algorithms/src/primality_tests/fermat_primality_test"}, {"category": "solovay-strassen primality test", "description": "primality tests solovay-strassen primality test", "location": "/code/mathematical_algorithms/src/primality_tests/solovay-strassen_primality_test"}, {"category": "integer to roman", "description": "mathematical algorithms integer to roman", "location": "/code/mathematical_algorithms/src/integer_to_roman"}, {"category": "next larger number", "description": "mathematical algorithms next larger number", "location": "/code/mathematical_algorithms/src/next_larger_number"}, {"category": "pascal triangle", "description": "mathematical algorithms pascal triangle", "location": "/code/mathematical_algorithms/src/pascal_triangle"}, {"category": "sieve of atkin", "description": "mathematical algorithms sieve of atkin", "location": "/code/mathematical_algorithms/src/sieve_of_atkin"}, {"category": "delannoy number", "description": "mathematical algorithms delannoy number", "location": "/code/mathematical_algorithms/src/delannoy_number"}, {"category": "newman conway", "description": "mathematical algorithms newman conway", "location": "/code/mathematical_algorithms/src/newman_conway"}, {"category": "reverse factorial", "description": "mathematical algorithms reverse factorial", "location": "/code/mathematical_algorithms/src/reverse_factorial"}, {"category": "perfect number", "description": "mathematical algorithms perfect number", "location": "/code/mathematical_algorithms/src/perfect_number"}, {"category": "segmented sieve of eratosthenes", "description": "mathematical algorithms segmented sieve of eratosthenes", "location": "/code/mathematical_algorithms/src/segmented_sieve_of_eratosthenes"}, {"category": "lucas theorem", "description": "mathematical algorithms lucas theorem", "location": "/code/mathematical_algorithms/src/lucas_theorem"}, {"category": "fast inverse sqrt", "description": "mathematical algorithms fast inverse sqrt", "location": "/code/mathematical_algorithms/src/fast_inverse_sqrt"}, {"category": "sieve of eratosthenes", "description": "mathematical algorithms sieve of eratosthenes", "location": "/code/mathematical_algorithms/src/sieve_of_eratosthenes"}, {"category": "permutation lexicographic order", "description": "mathematical algorithms permutation lexicographic order", "location": "/code/mathematical_algorithms/src/permutation_lexicographic_order"}, {"category": "tribonacci numbers", "description": "mathematical algorithms tribonacci numbers", "location": "/code/mathematical_algorithms/src/tribonacci_numbers"}, {"category": "prime numbers of n", "description": "mathematical algorithms prime numbers of n", "location": "/code/mathematical_algorithms/src/prime_numbers_of_n"}, {"category": "catalan number", "description": "mathematical algorithms catalan number", "location": "/code/mathematical_algorithms/src/catalan_number"}, {"category": "multiply polynomial", "description": "mathematical algorithms multiply polynomial", "location": "/code/mathematical_algorithms/src/multiply_polynomial"}, {"category": "derangements", "description": "mathematical algorithms derangements", "location": "/code/mathematical_algorithms/src/derangements"}, {"category": "count trailing zeroes", "description": "mathematical algorithms count trailing zeroes", "location": "/code/mathematical_algorithms/src/count_trailing_zeroes"}, {"category": "average stream numbers", "description": "mathematical algorithms average stream numbers", "location": "/code/mathematical_algorithms/src/average_stream_numbers"}, {"category": "replace 0 with 5", "description": "mathematical algorithms replace 0 with 5", "location": "/code/mathematical_algorithms/src/replace_0_with_5"}, {"category": "modular inverse", "description": "mathematical algorithms modular inverse", "location": "/code/mathematical_algorithms/src/modular_inverse"}, {"category": "hill climbing", "description": "mathematical algorithms hill climbing", "location": "/code/mathematical_algorithms/src/hill_climbing"}, {"category": "simpsons rule", "description": "mathematical algorithms simpsons rule", "location": "/code/mathematical_algorithms/src/simpsons_rule"}, {"category": "gaussian elimination", "description": "mathematical algorithms gaussian elimination", "location": "/code/mathematical_algorithms/src/gaussian_elimination"}, {"category": "scala", "description": "gaussian elimination scala", "location": "/code/mathematical_algorithms/src/gaussian_elimination/scala"}, {"category": "src", "description": "scala", "location": "/code/mathematical_algorithms/src/gaussian_elimination/scala/src"}, {"category": "main", "description": "scala main", "location": "/code/mathematical_algorithms/src/gaussian_elimination/scala/src/main"}, {"category": "scala", "description": "main scala", "location": "/code/mathematical_algorithms/src/gaussian_elimination/scala/src/main/scala"}, {"category": "gaussian", "description": "scala gaussian", "location": "/code/mathematical_algorithms/src/gaussian_elimination/scala/src/main/scala/gaussian"}, {"category": "elimination", "description": "gaussian elimination", "location": "/code/mathematical_algorithms/src/gaussian_elimination/scala/src/main/scala/gaussian/elimination"}, {"category": "structures", "description": "scala structures", "location": "/code/mathematical_algorithms/src/gaussian_elimination/scala/src/main/scala/structures"}, {"category": "project", "description": "scala project", "location": "/code/mathematical_algorithms/src/gaussian_elimination/scala/project"}, {"category": "pandigital number", "description": "mathematical algorithms pandigital number", "location": "/code/mathematical_algorithms/src/pandigital_number"}, {"category": "reverse number", "description": "mathematical algorithms reverse number", "location": "/code/mathematical_algorithms/src/reverse_number"}, {"category": "horner polynomial evaluation", "description": "mathematical algorithms horner polynomial evaluation", "location": "/code/mathematical_algorithms/src/horner_polynomial_evaluation"}, {"category": "newton raphson method", "description": "mathematical algorithms newton raphson method", "location": "/code/mathematical_algorithms/src/newton_raphson_method"}, {"category": "euler totient", "description": "mathematical algorithms euler totient", "location": "/code/mathematical_algorithms/src/euler_totient"}, {"category": "russian peasant multiplication", "description": "mathematical algorithms russian peasant multiplication", "location": "/code/mathematical_algorithms/src/russian_peasant_multiplication"}, {"category": "exponentiation power", "description": "mathematical algorithms exponentiation power", "location": "/code/mathematical_algorithms/src/exponentiation_power"}, {"category": "exponentiation by squaring", "description": "exponentiation power exponentiation by squaring", "location": "/code/mathematical_algorithms/src/exponentiation_power/exponentiation_by_squaring"}, {"category": "lucky number", "description": "mathematical algorithms lucky number", "location": "/code/mathematical_algorithms/src/lucky_number"}, {"category": "integer conversion", "description": "mathematical algorithms integer conversion", "location": "/code/mathematical_algorithms/src/integer_conversion"}, {"category": "poisson sample", "description": "mathematical algorithms poisson sample", "location": "/code/mathematical_algorithms/src/poisson_sample"}, {"category": "add polynomials", "description": "mathematical algorithms add polynomials", "location": "/code/mathematical_algorithms/src/add_polynomials"}, {"category": "dfa division", "description": "mathematical algorithms dfa division", "location": "/code/mathematical_algorithms/src/dfa_division"}, {"category": "jacobi method", "description": "mathematical algorithms jacobi method", "location": "/code/mathematical_algorithms/src/jacobi_method"}, {"category": "greatest digit in number", "description": "mathematical algorithms greatest digit in number", "location": "/code/mathematical_algorithms/src/greatest_digit_in_number"}, {"category": "magic square", "description": "mathematical algorithms magic square", "location": "/code/mathematical_algorithms/src/magic_square"}, {"category": "automorphic numbers", "description": "mathematical algorithms automorphic numbers", "location": "/code/mathematical_algorithms/src/automorphic_numbers"}, {"category": "pythagorean triplet", "description": "mathematical algorithms pythagorean triplet", "location": "/code/mathematical_algorithms/src/pythagorean_triplet"}, {"category": "decoding of string", "description": "mathematical algorithms decoding of string", "location": "/code/mathematical_algorithms/src/decoding_of_string"}, {"category": "karatsuba multiplication", "description": "mathematical algorithms karatsuba multiplication", "location": "/code/mathematical_algorithms/src/karatsuba_multiplication"}, {"category": "newton polynomial", "description": "mathematical algorithms newton polynomial", "location": "/code/mathematical_algorithms/src/newton_polynomial"}, {"category": "coprime numbers", "description": "mathematical algorithms coprime numbers", "location": "/code/mathematical_algorithms/src/coprime_numbers"}, {"category": "shuffle array", "description": "mathematical algorithms shuffle array", "location": "/code/mathematical_algorithms/src/shuffle_array"}, {"category": "diophantine", "description": "mathematical algorithms diophantine", "location": "/code/mathematical_algorithms/src/diophantine"}, {"category": "babylonian method", "description": "mathematical algorithms babylonian method", "location": "/code/mathematical_algorithms/src/babylonian_method"}, {"category": "std", "description": "mathematical algorithms std", "location": "/code/mathematical_algorithms/src/std"}, {"category": "largrange polynomial", "description": "mathematical algorithms largrange polynomial", "location": "/code/mathematical_algorithms/src/largrange_polynomial"}, {"category": "divided differences", "description": "mathematical algorithms divided differences", "location": "/code/mathematical_algorithms/src/divided_differences"}, {"category": "smallest digit in number", "description": "mathematical algorithms smallest digit in number", "location": "/code/mathematical_algorithms/src/smallest_digit_in_number"}, {"category": "square free number", "description": "mathematical algorithms square free number", "location": "/code/mathematical_algorithms/src/square_free_number"}, {"category": "convolution", "description": "mathematical algorithms convolution", "location": "/code/mathematical_algorithms/src/convolution"}, {"category": "check is square", "description": "mathematical algorithms check is square", "location": "/code/mathematical_algorithms/src/check_is_square"}, {"category": "2sum", "description": "mathematical algorithms 2sum", "location": "/code/mathematical_algorithms/src/2sum"}, {"category": "steepest descent", "description": "mathematical algorithms steepest descent", "location": "/code/mathematical_algorithms/src/steepest_descent"}, {"category": "taxicab numbers", "description": "mathematical algorithms taxicab numbers", "location": "/code/mathematical_algorithms/src/taxicab_numbers"}, {"category": "fractals", "description": "mathematical algorithms fractals", "location": "/code/mathematical_algorithms/src/fractals"}, {"category": "fermats little theorem", "description": "mathematical algorithms fermats little theorem", "location": "/code/mathematical_algorithms/src/fermats_little_theorem"}, {"category": "tridiagonal matrix", "description": "mathematical algorithms tridiagonal matrix", "location": "/code/mathematical_algorithms/src/tridiagonal_matrix"}, {"category": "amicable numbers", "description": "mathematical algorithms amicable numbers", "location": "/code/mathematical_algorithms/src/amicable_numbers"}, {"category": "fast fourier transform", "description": "mathematical algorithms fast fourier transform", "location": "/code/mathematical_algorithms/src/fast_fourier_transform"}, {"category": "factorial", "description": "mathematical algorithms factorial", "location": "/code/mathematical_algorithms/src/factorial"}, {"category": "armstrong numbers", "description": "mathematical algorithms armstrong numbers", "location": "/code/mathematical_algorithms/src/armstrong_numbers"}, {"category": "theory of computation", "description": "code theory of computation", "location": "/code/theory_of_computation"}, {"category": "src", "description": "theory of computation", "location": "/code/theory_of_computation/src"}, {"category": "nondeterministic finite atomaton", "description": "theory of computation nondeterministic finite atomaton", "location": "/code/theory_of_computation/src/nondeterministic_finite_atomaton"}, {"category": "deterministic finite automaton", "description": "theory of computation deterministic finite automaton", "location": "/code/theory_of_computation/src/deterministic_finite_automaton"}, {"category": "cryptography", "description": "code cryptography", "location": "/code/cryptography"}, {"category": "test", "description": "cryptography", "location": "/code/cryptography/test"}, {"category": "baconian cipher", "description": "cryptography baconian cipher", "location": "/code/cryptography/test/baconian_cipher"}, {"category": "src", "description": "cryptography", "location": "/code/cryptography/src"}, {"category": "rsa", "description": "cryptography rsa", "location": "/code/cryptography/src/rsa"}, {"category": "caesar cipher", "description": "cryptography caesar cipher", "location": "/code/cryptography/src/caesar_cipher"}, {"category": "vigenere cipher", "description": "cryptography vigenere cipher", "location": "/code/cryptography/src/vigenere_cipher"}, {"category": "aes 128", "description": "cryptography aes 128", "location": "/code/cryptography/src/aes_128"}, {"category": "aes csharp", "description": "aes 128 aes csharp", "location": "/code/cryptography/src/aes_128/aes_csharp"}, {"category": "example", "description": "aes csharp example", "location": "/code/cryptography/src/aes_128/aes_csharp/example"}, {"category": "sha", "description": "cryptography sha", "location": "/code/cryptography/src/sha"}, {"category": "sha 256", "description": "sha sha 256", "location": "/code/cryptography/src/sha/sha_256"}, {"category": "rot13 cipher", "description": "cryptography rot13 cipher", "location": "/code/cryptography/src/rot13_cipher"}, {"category": "baconian cipher", "description": "cryptography baconian cipher", "location": "/code/cryptography/src/baconian_cipher"}, {"category": "porta cipher", "description": "cryptography porta cipher", "location": "/code/cryptography/src/porta_cipher"}, {"category": "rsa digital signature", "description": "cryptography rsa digital signature", "location": "/code/cryptography/src/rsa_digital_signature"}, {"category": "huffman encoding", "description": "cryptography huffman encoding", "location": "/code/cryptography/src/huffman_encoding"}, {"category": "morse cipher", "description": "cryptography morse cipher", "location": "/code/cryptography/src/morse_cipher"}, {"category": "runningkey cipher", "description": "cryptography runningkey cipher", "location": "/code/cryptography/src/runningkey_cipher"}, {"category": "columnar transposition cipher", "description": "cryptography columnar transposition cipher", "location": "/code/cryptography/src/columnar_transposition_cipher"}, {"category": "rail fence cipher", "description": "cryptography rail fence cipher", "location": "/code/cryptography/src/rail_fence_cipher"}, {"category": "polybius cipher", "description": "cryptography polybius cipher", "location": "/code/cryptography/src/polybius_cipher"}, {"category": "affine cipher", "description": "cryptography affine cipher", "location": "/code/cryptography/src/affine_cipher"}, {"category": "autokey cipher", "description": "cryptography autokey cipher", "location": "/code/cryptography/src/autokey_cipher"}, {"category": "atbash cipher", "description": "cryptography atbash cipher", "location": "/code/cryptography/src/atbash_cipher"}, {"category": "bit manipulation", "description": "code bit manipulation", "location": "/code/bit_manipulation"}, {"category": "test", "description": "bit manipulation", "location": "/code/bit_manipulation/test"}, {"category": "src", "description": "bit manipulation", "location": "/code/bit_manipulation/src"}, {"category": "lonely integer", "description": "bit manipulation lonely integer", "location": "/code/bit_manipulation/src/lonely_integer"}, {"category": "sum binary numbers", "description": "bit manipulation sum binary numbers", "location": "/code/bit_manipulation/src/sum_binary_numbers"}, {"category": "addition using bits", "description": "bit manipulation addition using bits", "location": "/code/bit_manipulation/src/addition_using_bits"}, {"category": "thrice unique number", "description": "bit manipulation thrice unique number", "location": "/code/bit_manipulation/src/thrice_unique_number"}, {"category": "xor swap", "description": "bit manipulation xor swap", "location": "/code/bit_manipulation/src/xor_swap"}, {"category": "invert bit", "description": "bit manipulation invert bit", "location": "/code/bit_manipulation/src/invert_bit"}, {"category": "bit division", "description": "bit manipulation bit division", "location": "/code/bit_manipulation/src/bit_division"}, {"category": "convert number binary", "description": "bit manipulation convert number binary", "location": "/code/bit_manipulation/src/convert_number_binary"}, {"category": "subset generation", "description": "bit manipulation subset generation", "location": "/code/bit_manipulation/src/subset_generation"}, {"category": "hamming distance", "description": "bit manipulation hamming distance", "location": "/code/bit_manipulation/src/hamming_distance"}, {"category": "flip bits", "description": "bit manipulation flip bits", "location": "/code/bit_manipulation/src/flip_bits"}, {"category": "sum equals xor", "description": "bit manipulation sum equals xor", "location": "/code/bit_manipulation/src/sum_equals_xor"}, {"category": "count set bits", "description": "bit manipulation count set bits", "location": "/code/bit_manipulation/src/count_set_bits"}, {"category": "twice unique number", "description": "bit manipulation twice unique number", "location": "/code/bit_manipulation/src/twice_unique_number"}, {"category": "maximum xor value", "description": "bit manipulation maximum xor value", "location": "/code/bit_manipulation/src/maximum_xor_value"}, {"category": "power of 2", "description": "bit manipulation power of 2", "location": "/code/bit_manipulation/src/power_of_2"}, {"category": "byte swapper", "description": "bit manipulation byte swapper", "location": "/code/bit_manipulation/src/byte_swapper"}, {"category": "magic number", "description": "bit manipulation magic number", "location": "/code/bit_manipulation/src/magic_number"}, {"category": "filters", "description": "code filters", "location": "/code/filters"}, {"category": "src", "description": "filters", "location": "/code/filters/src"}, {"category": "gaussian filter", "description": "filters gaussian filter", "location": "/code/filters/src/gaussian_filter"}, {"category": "median filter", "description": "filters median filter", "location": "/code/filters/src/median_filter"}, {"category": "compression", "description": "code compression", "location": "/code/compression"}, {"category": "test", "description": "compression", "location": "/code/compression/test"}, {"category": "lossless compression", "description": "compression lossless compression", "location": "/code/compression/test/lossless_compression"}, {"category": "huffman", "description": "lossless compression huffman", "location": "/code/compression/test/lossless_compression/huffman"}, {"category": "src", "description": "compression", "location": "/code/compression/src"}, {"category": "lossless compression", "description": "compression lossless compression", "location": "/code/compression/src/lossless_compression"}, {"category": "lempel-ziv-welch", "description": "lossless compression lempel-ziv-welch", "location": "/code/compression/src/lossless_compression/lempel-ziv-welch"}, {"category": "huffman", "description": "lossless compression huffman", "location": "/code/compression/src/lossless_compression/huffman"}, {"category": "lossy compression", "description": "compression lossy compression", "location": "/code/compression/src/lossy_compression"}, {"category": "divide conquer", "description": "code divide conquer", "location": "/code/divide_conquer"}, {"category": "test", "description": "divide conquer", "location": "/code/divide_conquer/test"}, {"category": "src", "description": "divide conquer", "location": "/code/divide_conquer/src"}, {"category": "maximum contiguous subsequence sum", "description": "divide conquer maximum contiguous subsequence sum", "location": "/code/divide_conquer/src/maximum_contiguous_subsequence_sum"}, {"category": "merge sort using divide and conquer", "description": "divide conquer merge sort using divide and conquer", "location": "/code/divide_conquer/src/merge_sort_using_divide_and_conquer"}, {"category": "warnock algorithm", "description": "divide conquer warnock algorithm", "location": "/code/divide_conquer/src/warnock_algorithm"}, {"category": "tournament method to find min max", "description": "divide conquer tournament method to find min max", "location": "/code/divide_conquer/src/tournament_method_to_find_min_max"}, {"category": "inversion count", "description": "divide conquer inversion count", "location": "/code/divide_conquer/src/inversion_count"}, {"category": "Strassen matrix multiplication", "description": "divide conquer Strassen matrix multiplication", "location": "/code/divide_conquer/src/Strassen_matrix_multiplication"}, {"category": "x power y", "description": "divide conquer x power y", "location": "/code/divide_conquer/src/x_power_y"}, {"category": "closest pair of points", "description": "divide conquer closest pair of points", "location": "/code/divide_conquer/src/closest_pair_of_points"}, {"category": "karatsuba multiplication", "description": "divide conquer karatsuba multiplication", "location": "/code/divide_conquer/src/karatsuba_multiplication"}, {"category": "quick sort", "description": "divide conquer quick sort", "location": "/code/divide_conquer/src/quick_sort"}, {"category": "factorial", "description": "divide conquer factorial", "location": "/code/divide_conquer/src/factorial"}, {"category": "sorting", "description": "code sorting", "location": "/code/sorting"}, {"category": "test", "description": "sorting", "location": "/code/sorting/test"}, {"category": "src", "description": "sorting", "location": "/code/sorting/src"}, {"category": "circle sort", "description": "sorting circle sort", "location": "/code/sorting/src/circle_sort"}, {"category": "flash sort", "description": "sorting flash sort", "location": "/code/sorting/src/flash_sort"}, {"category": "radix sort", "description": "sorting radix sort", "location": "/code/sorting/src/radix_sort"}, {"category": "tree sort", "description": "sorting tree sort", "location": "/code/sorting/src/tree_sort"}, {"category": "gnome sort", "description": "sorting gnome sort", "location": "/code/sorting/src/gnome_sort"}, {"category": "sleep sort", "description": "sorting sleep sort", "location": "/code/sorting/src/sleep_sort"}, {"category": "bucket sort", "description": "sorting bucket sort", "location": "/code/sorting/src/bucket_sort"}, {"category": "selection sort", "description": "sorting selection sort", "location": "/code/sorting/src/selection_sort"}, {"category": "counting sort", "description": "sorting counting sort", "location": "/code/sorting/src/counting_sort"}, {"category": "heap sort", "description": "sorting heap sort", "location": "/code/sorting/src/heap_sort"}, {"category": "comb sort", "description": "sorting comb sort", "location": "/code/sorting/src/comb_sort"}, {"category": "bubble sort", "description": "sorting bubble sort", "location": "/code/sorting/src/bubble_sort"}, {"category": "shell sort", "description": "sorting shell sort", "location": "/code/sorting/src/shell_sort"}, {"category": "pigeonhole sort", "description": "sorting pigeonhole sort", "location": "/code/sorting/src/pigeonhole_sort"}, {"category": "bogo sort", "description": "sorting bogo sort", "location": "/code/sorting/src/bogo_sort"}, {"category": "median sort", "description": "sorting median sort", "location": "/code/sorting/src/median_sort"}, {"category": "merge sort", "description": "sorting merge sort", "location": "/code/sorting/src/merge_sort"}, {"category": "topological sort", "description": "sorting topological sort", "location": "/code/sorting/src/topological_sort"}, {"category": "intro sort", "description": "sorting intro sort", "location": "/code/sorting/src/intro_sort"}, {"category": "shaker sort", "description": "sorting shaker sort", "location": "/code/sorting/src/shaker_sort"}, {"category": "stooge sort", "description": "sorting stooge sort", "location": "/code/sorting/src/stooge_sort"}, {"category": "cycle sort", "description": "sorting cycle sort", "location": "/code/sorting/src/cycle_sort"}, {"category": "insertion sort", "description": "sorting insertion sort", "location": "/code/sorting/src/insertion_sort"}, {"category": "quick sort", "description": "sorting quick sort", "location": "/code/sorting/src/quick_sort"}, {"category": "bead sort", "description": "sorting bead sort", "location": "/code/sorting/src/bead_sort"}, {"category": "data structures", "description": "code data structures", "location": "/code/data_structures"}, {"category": "test", "description": "data structures", "location": "/code/data_structures/test"}, {"category": "list", "description": "data structures list", "location": "/code/data_structures/test/list"}, {"category": "tree", "description": "data structures tree", "location": "/code/data_structures/test/tree"}, {"category": "binary tree", "description": "tree binary tree", "location": "/code/data_structures/test/tree/binary_tree"}, {"category": "binary tree", "description": "binary tree binary tree", "location": "/code/data_structures/test/tree/binary_tree/binary_tree"}, {"category": "diameter", "description": "binary tree diameter", "location": "/code/data_structures/test/tree/binary_tree/binary_tree/diameter"}, {"category": "path sum", "description": "binary tree path sum", "location": "/code/data_structures/test/tree/binary_tree/binary_tree/path_sum"}, {"category": "is same", "description": "binary tree is same", "location": "/code/data_structures/test/tree/binary_tree/binary_tree/is_same"}, {"category": "multiway tree", "description": "tree multiway tree", "location": "/code/data_structures/test/tree/multiway_tree"}, {"category": "red black tree", "description": "multiway tree red black tree", "location": "/code/data_structures/test/tree/multiway_tree/red_black_tree"}, {"category": "union find", "description": "multiway tree union find", "location": "/code/data_structures/test/tree/multiway_tree/union_find"}, {"category": "src", "description": "data structures", "location": "/code/data_structures/src"}, {"category": "list", "description": "data structures list", "location": "/code/data_structures/src/list"}, {"category": "doubly linked list", "description": "list doubly linked list", "location": "/code/data_structures/src/list/doubly_linked_list"}, {"category": "C", "description": "doubly linked list C", "location": "/code/data_structures/src/list/doubly_linked_list/C"}, {"category": "skip list", "description": "list skip list", "location": "/code/data_structures/src/list/skip_list"}, {"category": "xor linked list", "description": "list xor linked list", "location": "/code/data_structures/src/list/xor_linked_list"}, {"category": "circular linked list", "description": "list circular linked list", "location": "/code/data_structures/src/list/circular_linked_list"}, {"category": "operations", "description": "circular linked list operations", "location": "/code/data_structures/src/list/circular_linked_list/operations"}, {"category": "singly linked list", "description": "list singly linked list", "location": "/code/data_structures/src/list/singly_linked_list"}, {"category": "operations", "description": "singly linked list operations", "location": "/code/data_structures/src/list/singly_linked_list/operations"}, {"category": "unclassified", "description": "operations unclassified", "location": "/code/data_structures/src/list/singly_linked_list/operations/unclassified"}, {"category": "push", "description": "operations push", "location": "/code/data_structures/src/list/singly_linked_list/operations/push"}, {"category": "reverse", "description": "operations reverse", "location": "/code/data_structures/src/list/singly_linked_list/operations/reverse"}, {"category": "find", "description": "operations find", "location": "/code/data_structures/src/list/singly_linked_list/operations/find"}, {"category": "detect cycle", "description": "operations detect cycle", "location": "/code/data_structures/src/list/singly_linked_list/operations/detect_cycle"}, {"category": "print reverse", "description": "operations print reverse", "location": "/code/data_structures/src/list/singly_linked_list/operations/print_reverse"}, {"category": "rotate", "description": "operations rotate", "location": "/code/data_structures/src/list/singly_linked_list/operations/rotate"}, {"category": "n th node linked list", "description": "operations n th node linked list", "location": "/code/data_structures/src/list/singly_linked_list/operations/n_th_node_linked_list"}, {"category": "sort", "description": "operations sort", "location": "/code/data_structures/src/list/singly_linked_list/operations/sort"}, {"category": "delete", "description": "operations delete", "location": "/code/data_structures/src/list/singly_linked_list/operations/delete"}, {"category": "insertion", "description": "operations insertion", "location": "/code/data_structures/src/list/singly_linked_list/operations/insertion"}, {"category": "merge sorted", "description": "operations merge sorted", "location": "/code/data_structures/src/list/singly_linked_list/operations/merge_sorted"}, {"category": "tree", "description": "data structures tree", "location": "/code/data_structures/src/tree"}, {"category": "heap", "description": "tree heap", "location": "/code/data_structures/src/tree/heap"}, {"category": "pairing heap", "description": "heap pairing heap", "location": "/code/data_structures/src/tree/heap/pairing_heap"}, {"category": "soft heap", "description": "heap soft heap", "location": "/code/data_structures/src/tree/heap/soft_heap"}, {"category": "priority queue", "description": "heap priority queue", "location": "/code/data_structures/src/tree/heap/priority_queue"}, {"category": "leftist tree", "description": "priority queue leftist tree", "location": "/code/data_structures/src/tree/heap/priority_queue/leftist_tree"}, {"category": "min heap", "description": "heap min heap", "location": "/code/data_structures/src/tree/heap/min_heap"}, {"category": "binomial heap", "description": "heap binomial heap", "location": "/code/data_structures/src/tree/heap/binomial_heap"}, {"category": "max heap", "description": "heap max heap", "location": "/code/data_structures/src/tree/heap/max_heap"}, {"category": "tree", "description": "tree tree", "location": "/code/data_structures/src/tree/tree"}, {"category": "suffix array", "description": "tree suffix array", "location": "/code/data_structures/src/tree/tree/suffix_array"}, {"category": "trie", "description": "tree trie", "location": "/code/data_structures/src/tree/tree/trie"}, {"category": "Van Emde Boas Tree", "description": "tree Van Emde Boas Tree", "location": "/code/data_structures/src/tree/Van_Emde_Boas_Tree"}, {"category": "binary tree", "description": "tree binary tree", "location": "/code/data_structures/src/tree/binary_tree"}, {"category": "treap", "description": "binary tree treap", "location": "/code/data_structures/src/tree/binary_tree/treap"}, {"category": "binary tree", "description": "binary tree binary tree", "location": "/code/data_structures/src/tree/binary_tree/binary_tree"}, {"category": "traversal", "description": "binary tree traversal", "location": "/code/data_structures/src/tree/binary_tree/binary_tree/traversal"}, {"category": "preorder", "description": "traversal preorder", "location": "/code/data_structures/src/tree/binary_tree/binary_tree/traversal/preorder"}, {"category": "left view", "description": "preorder left view", "location": "/code/data_structures/src/tree/binary_tree/binary_tree/traversal/preorder/left_view"}, {"category": "right view", "description": "preorder right view", "location": "/code/data_structures/src/tree/binary_tree/binary_tree/traversal/preorder/right_view"}, {"category": "inorder", "description": "traversal inorder", "location": "/code/data_structures/src/tree/binary_tree/binary_tree/traversal/inorder"}, {"category": "right threaded", "description": "inorder right threaded", "location": "/code/data_structures/src/tree/binary_tree/binary_tree/traversal/inorder/right_threaded"}, {"category": "zigzag", "description": "traversal zigzag", "location": "/code/data_structures/src/tree/binary_tree/binary_tree/traversal/zigzag"}, {"category": "minimum height", "description": "binary tree minimum height", "location": "/code/data_structures/src/tree/binary_tree/binary_tree/minimum_height"}, {"category": "is binary tree", "description": "binary tree is binary tree", "location": "/code/data_structures/src/tree/binary_tree/binary_tree/is_binary_tree"}, {"category": "diameter", "description": "binary tree diameter", "location": "/code/data_structures/src/tree/binary_tree/binary_tree/diameter"}, {"category": "path sum", "description": "binary tree path sum", "location": "/code/data_structures/src/tree/binary_tree/binary_tree/path_sum"}, {"category": "sum left", "description": "path sum sum left", "location": "/code/data_structures/src/tree/binary_tree/binary_tree/path_sum/sum_left"}, {"category": "convert to doubly linked list", "description": "binary tree convert to doubly linked list", "location": "/code/data_structures/src/tree/binary_tree/binary_tree/convert_to_doubly_linked_list"}, {"category": "is balance", "description": "binary tree is balance", "location": "/code/data_structures/src/tree/binary_tree/binary_tree/is_balance"}, {"category": "maximum height", "description": "binary tree maximum height", "location": "/code/data_structures/src/tree/binary_tree/binary_tree/maximum_height"}, {"category": "node", "description": "binary tree node", "location": "/code/data_structures/src/tree/binary_tree/binary_tree/node"}, {"category": "make binary tree", "description": "binary tree make binary tree", "location": "/code/data_structures/src/tree/binary_tree/binary_tree/make_binary_tree"}, {"category": "from inorder and postorder", "description": "make binary tree from inorder and postorder", "location": "/code/data_structures/src/tree/binary_tree/binary_tree/make_binary_tree/from_inorder_and_postorder"}, {"category": "from inorder and preorder", "description": "make binary tree from inorder and preorder", "location": "/code/data_structures/src/tree/binary_tree/binary_tree/make_binary_tree/from_inorder_and_preorder"}, {"category": "tree", "description": "binary tree tree", "location": "/code/data_structures/src/tree/binary_tree/binary_tree/tree"}, {"category": "bottom view binary tree", "description": "tree bottom view binary tree", "location": "/code/data_structures/src/tree/binary_tree/binary_tree/tree/bottom_view_binary_tree"}, {"category": "is same", "description": "binary tree is same", "location": "/code/data_structures/src/tree/binary_tree/binary_tree/is_same"}, {"category": "make mirror tree", "description": "binary tree make mirror tree", "location": "/code/data_structures/src/tree/binary_tree/binary_tree/make_mirror_tree"}, {"category": "serializer", "description": "binary tree serializer", "location": "/code/data_structures/src/tree/binary_tree/binary_tree/serializer"}, {"category": "aa tree", "description": "binary tree aa tree", "location": "/code/data_structures/src/tree/binary_tree/aa_tree"}, {"category": "rope", "description": "binary tree rope", "location": "/code/data_structures/src/tree/binary_tree/rope"}, {"category": "avl tree", "description": "binary tree avl tree", "location": "/code/data_structures/src/tree/binary_tree/avl_tree"}, {"category": "multiway tree", "description": "tree multiway tree", "location": "/code/data_structures/src/tree/multiway_tree"}, {"category": "van emde boas tree", "description": "multiway tree van emde boas tree", "location": "/code/data_structures/src/tree/multiway_tree/van_emde_boas_tree"}, {"category": "red black tree", "description": "multiway tree red black tree", "location": "/code/data_structures/src/tree/multiway_tree/red_black_tree"}, {"category": "union find", "description": "multiway tree union find", "location": "/code/data_structures/src/tree/multiway_tree/union_find"}, {"category": "splay tree", "description": "multiway tree splay tree", "location": "/code/data_structures/src/tree/multiway_tree/splay_tree"}, {"category": "fenwick tree", "description": "multiway tree fenwick tree", "location": "/code/data_structures/src/tree/multiway_tree/fenwick_tree"}, {"category": "b tree", "description": "tree b tree", "location": "/code/data_structures/src/tree/b_tree"}, {"category": "two three tree", "description": "b tree two three tree", "location": "/code/data_structures/src/tree/b_tree/two_three_tree"}, {"category": "b tree", "description": "b tree b tree", "location": "/code/data_structures/src/tree/b_tree/b_tree"}, {"category": "b tree C", "description": "b tree b tree C", "location": "/code/data_structures/src/tree/b_tree/b_tree/b_tree_C"}, {"category": "space partitioning tree", "description": "tree space partitioning tree", "location": "/code/data_structures/src/tree/space_partitioning_tree"}, {"category": "quad tree", "description": "space partitioning tree quad tree", "location": "/code/data_structures/src/tree/space_partitioning_tree/quad_tree"}, {"category": "interval tree", "description": "space partitioning tree interval tree", "location": "/code/data_structures/src/tree/space_partitioning_tree/interval_tree"}, {"category": "segment tree", "description": "space partitioning tree segment tree", "location": "/code/data_structures/src/tree/space_partitioning_tree/segment_tree"}, {"category": "kd tree", "description": "space partitioning tree kd tree", "location": "/code/data_structures/src/tree/space_partitioning_tree/kd_tree"}, {"category": "segment tree", "description": "tree segment tree", "location": "/code/data_structures/src/tree/segment_tree"}, {"category": "bag", "description": "data structures bag", "location": "/code/data_structures/src/bag"}, {"category": "stack", "description": "data structures stack", "location": "/code/data_structures/src/stack"}, {"category": "infix to postfix", "description": "stack infix to postfix", "location": "/code/data_structures/src/stack/infix_to_postfix"}, {"category": "reverse stack", "description": "stack reverse stack", "location": "/code/data_structures/src/stack/reverse_stack"}, {"category": "prefix to postfix", "description": "stack prefix to postfix", "location": "/code/data_structures/src/stack/prefix_to_postfix"}, {"category": "postfix evaluation", "description": "stack postfix evaluation", "location": "/code/data_structures/src/stack/postfix_evaluation"}, {"category": "sort stack", "description": "stack sort stack", "location": "/code/data_structures/src/stack/sort_stack"}, {"category": "stack", "description": "stack stack", "location": "/code/data_structures/src/stack/stack"}, {"category": "balanced expression", "description": "stack balanced expression", "location": "/code/data_structures/src/stack/balanced_expression"}, {"category": "abstract stack", "description": "stack abstract stack", "location": "/code/data_structures/src/stack/abstract_stack"}, {"category": "cpp", "description": "abstract stack cpp", "location": "/code/data_structures/src/stack/abstract_stack/cpp"}, {"category": "arrayStack", "description": "cpp arrayStack", "location": "/code/data_structures/src/stack/abstract_stack/cpp/arrayStack"}, {"category": "linked list", "description": "data structures linked list", "location": "/code/data_structures/src/linked_list"}, {"category": "queue", "description": "data structures queue", "location": "/code/data_structures/src/queue"}, {"category": "queue using linked list", "description": "queue queue using linked list", "location": "/code/data_structures/src/queue/queue_using_linked_list"}, {"category": "double ended queue", "description": "queue double ended queue", "location": "/code/data_structures/src/queue/double_ended_queue"}, {"category": "queue stream", "description": "queue queue stream", "location": "/code/data_structures/src/queue/queue_stream"}, {"category": "circular buffer", "description": "queue circular buffer", "location": "/code/data_structures/src/queue/circular_buffer"}, {"category": "reverse queue", "description": "queue reverse queue", "location": "/code/data_structures/src/queue/reverse_queue"}, {"category": "queue using stack", "description": "queue queue using stack", "location": "/code/data_structures/src/queue/queue_using_stack"}, {"category": "queue", "description": "queue queue", "location": "/code/data_structures/src/queue/queue"}, {"category": "hashs", "description": "data structures hashs", "location": "/code/data_structures/src/hashs"}, {"category": "bloom filter", "description": "hashs bloom filter", "location": "/code/data_structures/src/hashs/bloom_filter"}, {"category": "hash table", "description": "hashs hash table", "location": "/code/data_structures/src/hashs/hash_table"}, {"category": "other", "description": "data structures other", "location": "/code/data_structures/src/other"}, {"category": "networking", "description": "code networking", "location": "/code/networking"}, {"category": "test", "description": "networking", "location": "/code/networking/test"}, {"category": "src", "description": "networking", "location": "/code/networking/src"}, {"category": "validate IP", "description": "networking validate IP", "location": "/code/networking/src/validate_IP"}, {"category": "PacketSniffer", "description": "networking PacketSniffer", "location": "/code/networking/src/PacketSniffer"}, {"category": "img", "description": "PacketSniffer img", "location": "/code/networking/src/PacketSniffer/img"}, {"category": "determine endianess", "description": "networking determine endianess", "location": "/code/networking/src/determine_endianess"}, {"category": "computational geometry", "description": "code computational geometry", "location": "/code/computational_geometry"}, {"category": "test", "description": "computational geometry", "location": "/code/computational_geometry/test"}, {"category": "src", "description": "computational geometry", "location": "/code/computational_geometry/src"}, {"category": "area of triangle", "description": "computational geometry area of triangle", "location": "/code/computational_geometry/src/area_of_triangle"}, {"category": "axis aligned bounding box collision", "description": "computational geometry axis aligned bounding box collision", "location": "/code/computational_geometry/src/axis_aligned_bounding_box_collision"}, {"category": "sphere tetrahedron intersection", "description": "computational geometry sphere tetrahedron intersection", "location": "/code/computational_geometry/src/sphere_tetrahedron_intersection"}, {"category": "sutherland hodgeman clipping", "description": "computational geometry sutherland hodgeman clipping", "location": "/code/computational_geometry/src/sutherland_hodgeman_clipping"}, {"category": "chans algorithm", "description": "computational geometry chans algorithm", "location": "/code/computational_geometry/src/chans_algorithm"}, {"category": "quickhull", "description": "computational geometry quickhull", "location": "/code/computational_geometry/src/quickhull"}, {"category": "bresenham line", "description": "computational geometry bresenham line", "location": "/code/computational_geometry/src/bresenham_line"}, {"category": "area of polygon", "description": "computational geometry area of polygon", "location": "/code/computational_geometry/src/area_of_polygon"}, {"category": "halfplane intersection", "description": "computational geometry halfplane intersection", "location": "/code/computational_geometry/src/halfplane_intersection"}, {"category": "2d separating axis test", "description": "computational geometry 2d separating axis test", "location": "/code/computational_geometry/src/2d_separating_axis_test"}, {"category": "jarvis march", "description": "computational geometry jarvis march", "location": "/code/computational_geometry/src/jarvis_march"}, {"category": "2d line intersection", "description": "computational geometry 2d line intersection", "location": "/code/computational_geometry/src/2d_line_intersection"}, {"category": "cohen sutherland lineclip", "description": "computational geometry cohen sutherland lineclip", "location": "/code/computational_geometry/src/cohen_sutherland_lineclip"}, {"category": "distance between points", "description": "computational geometry distance between points", "location": "/code/computational_geometry/src/distance_between_points"}, {"category": "graham scan", "description": "computational geometry graham scan", "location": "/code/computational_geometry/src/graham_scan"}, {"category": "string algorithms", "description": "code string algorithms", "location": "/code/string_algorithms"}, {"category": "test", "description": "string algorithms", "location": "/code/string_algorithms/test"}, {"category": "src", "description": "string algorithms", "location": "/code/string_algorithms/src"}, {"category": "password strength checker", "description": "string algorithms password strength checker", "location": "/code/string_algorithms/src/password_strength_checker"}, {"category": "remove dups", "description": "string algorithms remove dups", "location": "/code/string_algorithms/src/remove_dups"}, {"category": "aho corasick algorithm", "description": "string algorithms aho corasick algorithm", "location": "/code/string_algorithms/src/aho_corasick_algorithm"}, {"category": "trie pattern search", "description": "string algorithms trie pattern search", "location": "/code/string_algorithms/src/trie_pattern_search"}, {"category": "morse code", "description": "string algorithms morse code", "location": "/code/string_algorithms/src/morse_code"}, {"category": "finite automata", "description": "string algorithms finite automata", "location": "/code/string_algorithms/src/finite_automata"}, {"category": "C", "description": "finite automata C", "location": "/code/string_algorithms/src/finite_automata/C"}, {"category": "arithmetic on large numbers", "description": "string algorithms arithmetic on large numbers", "location": "/code/string_algorithms/src/arithmetic_on_large_numbers"}, {"category": "levenshtein distance", "description": "string algorithms levenshtein distance", "location": "/code/string_algorithms/src/levenshtein_distance"}, {"category": "suffix array", "description": "string algorithms suffix array", "location": "/code/string_algorithms/src/suffix_array"}, {"category": "kasai algorithm", "description": "string algorithms kasai algorithm", "location": "/code/string_algorithms/src/kasai_algorithm"}, {"category": "anagram search", "description": "string algorithms anagram search", "location": "/code/string_algorithms/src/anagram_search"}, {"category": "palindrome checker", "description": "string algorithms palindrome checker", "location": "/code/string_algorithms/src/palindrome_checker"}, {"category": "naive pattern search", "description": "string algorithms naive pattern search", "location": "/code/string_algorithms/src/naive_pattern_search"}, {"category": "z algorithm", "description": "string algorithms z algorithm", "location": "/code/string_algorithms/src/z_algorithm"}, {"category": "palindrome substring", "description": "string algorithms palindrome substring", "location": "/code/string_algorithms/src/palindrome_substring"}, {"category": "rabin karp algorithm", "description": "string algorithms rabin karp algorithm", "location": "/code/string_algorithms/src/rabin_karp_algorithm"}, {"category": "lipogram checker", "description": "string algorithms lipogram checker", "location": "/code/string_algorithms/src/lipogram_checker"}, {"category": "manachar algorithm", "description": "string algorithms manachar algorithm", "location": "/code/string_algorithms/src/manachar_algorithm"}, {"category": "pangram checker", "description": "string algorithms pangram checker", "location": "/code/string_algorithms/src/pangram_checker"}, {"category": "kmp algorithm", "description": "string algorithms kmp algorithm", "location": "/code/string_algorithms/src/kmp_algorithm"}, {"category": "boyer moore algorithm", "description": "string algorithms boyer moore algorithm", "location": "/code/string_algorithms/src/boyer_moore_algorithm"}, {"category": "search", "description": "code search", "location": "/code/search"}, {"category": "test", "description": "search", "location": "/code/search/test"}, {"category": "src", "description": "search", "location": "/code/search/src"}, {"category": "ternary search", "description": "search ternary search", "location": "/code/search/src/ternary_search"}, {"category": "fibonacci search", "description": "search fibonacci search", "location": "/code/search/src/fibonacci_search"}, {"category": "jump search", "description": "search jump search", "location": "/code/search/src/jump_search"}, {"category": "linear search", "description": "search linear search", "location": "/code/search/src/linear_search"}, {"category": "interpolation search", "description": "search interpolation search", "location": "/code/search/src/interpolation_search"}, {"category": "fuzzy search", "description": "search fuzzy search", "location": "/code/search/src/fuzzy_search"}, {"category": "binary search", "description": "search binary search", "location": "/code/search/src/binary_search"}, {"category": "exponential search", "description": "search exponential search", "location": "/code/search/src/exponential_search"}, {"category": "online challenges", "description": "code online challenges", "location": "/code/online_challenges"}, {"category": "test", "description": "online challenges", "location": "/code/online_challenges/test"}, {"category": "src", "description": "online challenges", "location": "/code/online_challenges/src"}, {"category": "project euler", "description": "online challenges project euler", "location": "/code/online_challenges/src/project_euler"}, {"category": "problem 002", "description": "project euler problem 002", "location": "/code/online_challenges/src/project_euler/problem_002"}, {"category": "problem 026", "description": "project euler problem 026", "location": "/code/online_challenges/src/project_euler/problem_026"}, {"category": "problem 008", "description": "project euler problem 008", "location": "/code/online_challenges/src/project_euler/problem_008"}, {"category": "problem 010", "description": "project euler problem 010", "location": "/code/online_challenges/src/project_euler/problem_010"}, {"category": "problem 028", "description": "project euler problem 028", "location": "/code/online_challenges/src/project_euler/problem_028"}, {"category": "problem 004", "description": "project euler problem 004", "location": "/code/online_challenges/src/project_euler/problem_004"}, {"category": "problem 006", "description": "project euler problem 006", "location": "/code/online_challenges/src/project_euler/problem_006"}, {"category": "problem 024", "description": "project euler problem 024", "location": "/code/online_challenges/src/project_euler/problem_024"}, {"category": "problem 021", "description": "project euler problem 021", "location": "/code/online_challenges/src/project_euler/problem_021"}, {"category": "problem 003", "description": "project euler problem 003", "location": "/code/online_challenges/src/project_euler/problem_003"}, {"category": "problem 016", "description": "project euler problem 016", "location": "/code/online_challenges/src/project_euler/problem_016"}, {"category": "problem 001", "description": "project euler problem 001", "location": "/code/online_challenges/src/project_euler/problem_001"}, {"category": "problem 036", "description": "project euler problem 036", "location": "/code/online_challenges/src/project_euler/problem_036"}, {"category": "problem 007", "description": "project euler problem 007", "location": "/code/online_challenges/src/project_euler/problem_007"}, {"category": "problem 014", "description": "project euler problem 014", "location": "/code/online_challenges/src/project_euler/problem_014"}, {"category": "problem 025", "description": "project euler problem 025", "location": "/code/online_challenges/src/project_euler/problem_025"}, {"category": "problem 037", "description": "project euler problem 037", "location": "/code/online_challenges/src/project_euler/problem_037"}, {"category": "problem 020", "description": "project euler problem 020", "location": "/code/online_challenges/src/project_euler/problem_020"}, {"category": "problem 009", "description": "project euler problem 009", "location": "/code/online_challenges/src/project_euler/problem_009"}, {"category": "problem 067", "description": "project euler problem 067", "location": "/code/online_challenges/src/project_euler/problem_067"}, {"category": "problem 022", "description": "project euler problem 022", "location": "/code/online_challenges/src/project_euler/problem_022"}, {"category": "problem 005", "description": "project euler problem 005", "location": "/code/online_challenges/src/project_euler/problem_005"}, {"category": "problem 034", "description": "project euler problem 034", "location": "/code/online_challenges/src/project_euler/problem_034"}, {"category": "problem 018", "description": "project euler problem 018", "location": "/code/online_challenges/src/project_euler/problem_018"}, {"category": "problem 013", "description": "project euler problem 013", "location": "/code/online_challenges/src/project_euler/problem_013"}, {"category": "problem 012", "description": "project euler problem 012", "location": "/code/online_challenges/src/project_euler/problem_012"}, {"category": "problem 102", "description": "project euler problem 102", "location": "/code/online_challenges/src/project_euler/problem_102"}, {"category": "problem 040", "description": "project euler problem 040", "location": "/code/online_challenges/src/project_euler/problem_040"}, {"category": "problem 019", "description": "project euler problem 019", "location": "/code/online_challenges/src/project_euler/problem_019"}, {"category": "rosalind", "description": "online challenges rosalind", "location": "/code/online_challenges/src/rosalind"}, {"category": "complement dna strand", "description": "rosalind complement dna strand", "location": "/code/online_challenges/src/rosalind/complement_dna_strand"}, {"category": "game theory", "description": "code game theory", "location": "/code/game_theory"}, {"category": "src", "description": "game theory", "location": "/code/game_theory/src"}, {"category": "game of nim win loss prediction", "description": "game theory game of nim win loss prediction", "location": "/code/game_theory/src/game_of_nim_win_loss_prediction"}, {"category": "grundy numbers kayle", "description": "game theory grundy numbers kayle", "location": "/code/game_theory/src/grundy_numbers_kayle"}, {"category": "game of nim next best move", "description": "game theory game of nim next best move", "location": "/code/game_theory/src/game_of_nim_next_best_move"}, {"category": "artificial intelligence", "description": "code artificial intelligence", "location": "/code/artificial_intelligence"}, {"category": "test", "description": "artificial intelligence", "location": "/code/artificial_intelligence/test"}, {"category": "src", "description": "artificial intelligence", "location": "/code/artificial_intelligence/src"}, {"category": "DBSCAN Clustering", "description": "artificial intelligence DBSCAN Clustering", "location": "/code/artificial_intelligence/src/DBSCAN_Clustering"}, {"category": "neural network", "description": "artificial intelligence neural network", "location": "/code/artificial_intelligence/src/neural_network"}, {"category": "perceptron", "description": "artificial intelligence perceptron", "location": "/code/artificial_intelligence/src/perceptron"}, {"category": "SAT", "description": "artificial intelligence SAT", "location": "/code/artificial_intelligence/src/SAT"}, {"category": "decision tree", "description": "artificial intelligence decision tree", "location": "/code/artificial_intelligence/src/decision_tree"}, {"category": "gaussian naive bayes", "description": "artificial intelligence gaussian naive bayes", "location": "/code/artificial_intelligence/src/gaussian_naive_bayes"}, {"category": "Linear Regression", "description": "artificial intelligence Linear Regression", "location": "/code/artificial_intelligence/src/Linear_Regression"}, {"category": "k Nearest Neighbours", "description": "artificial intelligence k Nearest Neighbours", "location": "/code/artificial_intelligence/src/k_Nearest_Neighbours"}, {"category": "TSP", "description": "artificial intelligence TSP", "location": "/code/artificial_intelligence/src/TSP"}, {"category": "autoenncoder", "description": "artificial intelligence autoenncoder", "location": "/code/artificial_intelligence/src/autoenncoder"}, {"category": "gradient boosting trees", "description": "artificial intelligence gradient boosting trees", "location": "/code/artificial_intelligence/src/gradient_boosting_trees"}, {"category": "gaussian mixture model", "description": "artificial intelligence gaussian mixture model", "location": "/code/artificial_intelligence/src/gaussian_mixture_model"}, {"category": "naive bayes", "description": "artificial intelligence naive bayes", "location": "/code/artificial_intelligence/src/naive_bayes"}, {"category": "support vector machine", "description": "artificial intelligence support vector machine", "location": "/code/artificial_intelligence/src/support_vector_machine"}, {"category": "nearest sequence memory", "description": "artificial intelligence nearest sequence memory", "location": "/code/artificial_intelligence/src/nearest_sequence_memory"}, {"category": "nsm MATLAB", "description": "nearest sequence memory nsm MATLAB", "location": "/code/artificial_intelligence/src/nearest_sequence_memory/nsm_MATLAB"}, {"category": "Logistic Regression", "description": "artificial intelligence Logistic Regression", "location": "/code/artificial_intelligence/src/Logistic_Regression"}, {"category": "restricted boltzmann machine", "description": "artificial intelligence restricted boltzmann machine", "location": "/code/artificial_intelligence/src/restricted_boltzmann_machine"}, {"category": "minimax", "description": "artificial intelligence minimax", "location": "/code/artificial_intelligence/src/minimax"}, {"category": "Neural Style Transfer", "description": "artificial intelligence Neural Style Transfer", "location": "/code/artificial_intelligence/src/Neural_Style_Transfer"}, {"category": "ISODATA Clustering", "description": "artificial intelligence ISODATA Clustering", "location": "/code/artificial_intelligence/src/ISODATA_Clustering"}, {"category": "t distributed stochastic neighbor embedding", "description": "artificial intelligence t distributed stochastic neighbor embedding", "location": "/code/artificial_intelligence/src/t_distributed_stochastic_neighbor_embedding"}, {"category": "a star", "description": "artificial intelligence a star", "location": "/code/artificial_intelligence/src/a_star"}, {"category": "q learning", "description": "artificial intelligence q learning", "location": "/code/artificial_intelligence/src/q_learning"}, {"category": "factorization machines", "description": "artificial intelligence factorization machines", "location": "/code/artificial_intelligence/src/factorization_machines"}, {"category": "image processing", "description": "artificial intelligence image processing", "location": "/code/artificial_intelligence/src/image_processing"}, {"category": "PrewittFilter", "description": "image processing PrewittFilter", "location": "/code/artificial_intelligence/src/image_processing/PrewittFilter"}, {"category": "SobelFilter", "description": "image processing SobelFilter", "location": "/code/artificial_intelligence/src/image_processing/SobelFilter"}, {"category": "Canny", "description": "image processing Canny", "location": "/code/artificial_intelligence/src/image_processing/Canny"}, {"category": "houghTransform", "description": "image processing houghTransform", "location": "/code/artificial_intelligence/src/image_processing/houghTransform"}, {"category": "Image Stitching", "description": "image processing Image Stitching", "location": "/code/artificial_intelligence/src/image_processing/Image_Stitching"}, {"category": "img", "description": "Image Stitching img", "location": "/code/artificial_intelligence/src/image_processing/Image_Stitching/img"}, {"category": "Erode dilate", "description": "image processing Erode dilate", "location": "/code/artificial_intelligence/src/image_processing/Erode_dilate"}, {"category": "random forests", "description": "artificial intelligence random forests", "location": "/code/artificial_intelligence/src/random_forests"}, {"category": "artificial neural network", "description": "artificial intelligence artificial neural network", "location": "/code/artificial_intelligence/src/artificial_neural_network"}, {"category": "principal component analysis", "description": "artificial intelligence principal component analysis", "location": "/code/artificial_intelligence/src/principal_component_analysis"}, {"category": "hierachical-clustering", "description": "artificial intelligence hierachical-clustering", "location": "/code/artificial_intelligence/src/hierachical-clustering"}, {"category": "convolutional neural network", "description": "artificial intelligence convolutional neural network", "location": "/code/artificial_intelligence/src/convolutional_neural_network"}, {"category": "k means", "description": "artificial intelligence k means", "location": "/code/artificial_intelligence/src/k_means"}, {"category": "square root decomposition", "description": "code square root decomposition", "location": "/code/square_root_decomposition"}, {"category": "test", "description": "square root decomposition", "location": "/code/square_root_decomposition/test"}, {"category": "src", "description": "square root decomposition", "location": "/code/square_root_decomposition/src"}, {"category": "MOs Algorithm", "description": "square root decomposition MOs Algorithm", "location": "/code/square_root_decomposition/src/MOs_Algorithm"}, {"category": "backtracking", "description": "code backtracking", "location": "/code/backtracking"}, {"category": "test", "description": "backtracking", "location": "/code/backtracking/test"}, {"category": "src", "description": "backtracking", "location": "/code/backtracking/src"}, {"category": "crossword puzzle", "description": "backtracking crossword puzzle", "location": "/code/backtracking/src/crossword_puzzle"}, {"category": "sudoku solve", "description": "backtracking sudoku solve", "location": "/code/backtracking/src/sudoku_solve"}, {"category": "rat in a maze", "description": "backtracking rat in a maze", "location": "/code/backtracking/src/rat_in_a_maze"}, {"category": "knight tour", "description": "backtracking knight tour", "location": "/code/backtracking/src/knight_tour"}, {"category": "algorithm-x", "description": "backtracking algorithm-x", "location": "/code/backtracking/src/algorithm-x"}, {"category": "partitions of set", "description": "backtracking partitions of set", "location": "/code/backtracking/src/partitions_of_set"}, {"category": "n queen", "description": "backtracking n queen", "location": "/code/backtracking/src/n_queen"}, {"category": "partitions of number", "description": "backtracking partitions of number", "location": "/code/backtracking/src/partitions_of_number"}, {"category": "subset sum", "description": "backtracking subset sum", "location": "/code/backtracking/src/subset_sum"}, {"category": "powerset", "description": "backtracking powerset", "location": "/code/backtracking/src/powerset"}, {"category": "number of ways in maze", "description": "backtracking number of ways in maze", "location": "/code/backtracking/src/number_of_ways_in_maze"}, {"category": "m coloring problem", "description": "backtracking m coloring problem", "location": "/code/backtracking/src/m_coloring_problem"}, {"category": "permutations of string", "description": "backtracking permutations of string", "location": "/code/backtracking/src/permutations_of_string"}] \ No newline at end of file diff --git a/build/lib/dumps/trie.p b/build/lib/dumps/trie.p deleted file mode 100755 index 505f1b0..0000000 --- a/build/lib/dumps/trie.p +++ /dev/null @@ -1,5596 +0,0 @@ -ccopy_reg -_reconstructor -p0 -(cpygtrie -CharTrie -p1 -c__builtin__ -object -p2 -Ntp3 -Rp4 -(dp5 -S'_root' -p6 -g0 -(cpygtrie -_Node -p7 -g2 -Ntp8 -Rp9 -(lp10 -I4 -aV. -p11 -aVg -p12 -aVi -p13 -aVt -p14 -aI01 -aI3 -aVh -p15 -aVu -p16 -aVb -p17 -aI01 -aI-7 -aI3 -aV1 -p18 -aV0 -p19 -aV2 -p20 -aI01 -aI-2 -aI2 -ag20 -aV8 -p21 -aI01 -aI-3 -aI1 -ag19 -aI01 -aI2 -ag18 -ag19 -aI01 -aI-1 -aI1 -aV3 -p22 -aI01 -aI-1 -aI1 -ag20 -aI01 -aI-1 -aI1 -aV4 -p23 -aI01 -aI-1 -aI1 -aV6 -p24 -aI01 -aI-1 -aI1 -aV9 -p25 -aI01 -aI-1 -aI1 -ag21 -aI01 -aI-2 -aI2 -ag19 -ag18 -aI01 -aI-1 -aI1 -ag22 -aI01 -aI-1 -aI1 -ag20 -aI01 -aI-1 -aI1 -aV5 -p26 -aI01 -aI-1 -aI1 -ag23 -aI01 -aI-1 -aI1 -aV7 -p27 -aI01 -aI-1 -aI1 -ag24 -aI01 -aI-1 -aI1 -ag25 -aI01 -aI-1 -aI1 -ag21 -aI01 -aI-2 -aI2 -ag22 -ag23 -aI01 -aI-1 -aI1 -ag27 -aI01 -aI-1 -aI1 -ag24 -aI01 -aI-2 -aI2 -ag20 -ag18 -aI01 -aI-1 -aI1 -ag19 -aI01 -aI-1 -aI1 -ag20 -aI01 -aI-1 -aI1 -ag26 -aI01 -aI-1 -aI1 -ag23 -aI01 -aI-1 -aI1 -ag24 -aI01 -aI-1 -aI1 -ag21 -aI01 -aI-2 -aI2 -ag23 -ag19 -aI01 -aI-2 -aI2 -ag24 -ag27 -aI01 -aI-3 -aI1 -ag20 -aI01 -aI3 -aVs -p28 -ag16 -aVm -p29 -aI01 -aI-3 -aI2 -ag26 -ag24 -aI01 -aI-2 -aI1 -aVd -p30 -aI01 -aI-2 -aI1 -ag26 -aI01 -aI-1 -aI1 -aVa -p31 -aI01 -aI1 -ag31 -aI01 -aI-1 -aI6 -aVc -p32 -aVy -p33 -ag32 -aVl -p34 -ag13 -ag32 -aI01 -aI-5 -aI6 -ag14 -ag13 -aVv -p35 -ag13 -ag14 -ag33 -aI01 -aI-7 -aI7 -ag17 -ag28 -ag14 -aVr -p36 -ag31 -ag32 -ag14 -aI01 -aI-7 -aI2 -aVe -p37 -ag28 -aI01 -aI-2 -aI6 -ag30 -ag31 -aVp -p38 -ag14 -ag37 -ag36 -aI01 -aI-5 -aI7 -aVj -p39 -ag31 -ag32 -ag37 -aVn -p40 -ag32 -ag33 -aI01 -aI-7 -aI1 -ag30 -aI01 -aI5 -ag13 -ag14 -ag13 -aVo -p41 -ag40 -aI01 -aI-7 -aI5 -aVf -p42 -ag42 -ag13 -ag40 -ag37 -aI01 -aI-5 -aI2 -ag15 -ag41 -aI01 -aI-2 -aI7 -ag29 -ag13 -ag32 -ag31 -ag17 -ag34 -ag37 -aI01 -aI-7 -aI6 -ag34 -ag13 -ag12 -ag40 -ag37 -ag30 -aI01 -aI-5 -aI7 -ag12 -ag41 -ag36 -ag13 -ag14 -ag15 -ag29 -aI01 -aI1 -ag28 -aI01 -aI-1 -aI2 -aV- -p43 -aVx -p44 -aI01 -aI-10 -aI1 -ag40 -aI01 -aI6 -ag31 -ag34 -ag33 -ag28 -ag13 -ag28 -aI01 -aI-5 -aI4 -ag12 -ag36 -ag31 -ag29 -aI01 -aI-5 -aI1 -ag14 -aI01 -aI-1 -aI1 -ag30 -aI01 -aI-2 -aI9 -ag28 -ag28 -ag13 -ag12 -ag40 -ag29 -ag37 -ag40 -ag14 -aI01 -aI-8 -aI3 -ag14 -ag31 -ag36 -aI01 -aI-4 -aI9 -ag36 -ag13 -ag14 -ag15 -ag29 -ag37 -ag14 -ag13 -ag32 -aI01 -aI-8 -aI2 -ag37 -ag31 -aI01 -aI-2 -aI3 -ag36 -ag31 -ag33 -aI01 -aI5 -ag28 -ag14 -ag31 -ag32 -aVk -p45 -aI01 -aI-8 -aI7 -ag29 -ag28 -ag14 -ag36 -ag41 -ag40 -ag12 -aI01 -aI-7 -aI8 -ag14 -ag13 -ag42 -ag13 -ag32 -ag13 -ag31 -ag34 -aI01 -aI-9 -aI11 -ag16 -ag14 -ag41 -ag37 -ag40 -ag40 -ag32 -ag41 -ag30 -ag37 -ag36 -aI01 -aI-8 -aI3 -ag45 -ag37 -ag33 -aI01 -aI-3 -aI4 -ag29 -ag31 -ag14 -ag31 -aI01 -aI-1 -aI2 -ag41 -ag40 -aI01 -aI-4 -aI6 -ag41 -ag36 -ag38 -ag15 -ag13 -ag32 -aI01 -aI-10 -aI4 -ag14 -ag45 -ag13 -ag40 -aI01 -aI-3 -aI4 -ag17 -ag31 -ag28 -ag15 -aI01 -aI-4 -aI6 -ag41 -ag29 -ag31 -ag14 -ag41 -ag40 -aI01 -aI-7 -aI6 -ag35 -ag37 -ag36 -ag31 -ag12 -ag37 -aI01 -aI-5 -aI1 -ag34 -aI01 -aI-2 -aI3 -ag44 -ag13 -ag28 -aI01 -aI-4 -aI1 -ag32 -aI01 -aI4 -ag31 -ag36 -ag34 -ag41 -aI01 -aI-3 -aI4 -ag37 -ag28 -ag31 -ag36 -aI01 -aI-4 -aI5 -ag14 -ag31 -ag34 -ag31 -ag40 -aI01 -aI-5 -aI3 -ag40 -ag40 -ag33 -aI01 -aI-4 -aI1 -aV# -p46 -aI01 -aI-1 -aI7 -ag37 -ag34 -ag34 -ag16 -ag34 -ag31 -ag36 -aI01 -aI-6 -aI6 -ag40 -ag14 -ag36 -ag41 -ag13 -ag30 -aI01 -aI-4 -aI3 -ag37 -ag36 -ag28 -aI01 -aI-6 -aI5 -ag13 -ag38 -ag15 -ag37 -ag36 -aI01 -aI-4 -aI6 -ag36 -ag32 -ag16 -ag34 -ag31 -ag36 -aI01 -aI-4 -aI2 -ag34 -ag37 -aI01 -aI-5 -aI4 -ag15 -ag31 -ag13 -ag40 -aI01 -aI-2 -aI7 -ag34 -ag34 -ag37 -ag40 -ag12 -ag37 -ag28 -aI01 -aI-7 -aI2 -ag40 -ag28 -aI01 -aI-1 -aI2 -ag12 -ag37 -aI01 -aI-2 -aI3 -ag40 -ag37 -ag34 -aI01 -aI-5 -aI3 -ag37 -ag32 -ag45 -aI01 -aI3 -ag13 -ag40 -ag12 -aI01 -aI-3 -aI2 -ag37 -ag36 -aI01 -aI-6 -aI2 -aV+ -p47 -ag47 -aI01 -aI-2 -aI7 -ag34 -ag13 -ag38 -ag38 -ag13 -ag40 -ag12 -aI01 -aI-5 -aI5 -ag29 -ag17 -ag13 -ag40 -ag12 -aI01 -aI-6 -aI8 -ag16 -ag28 -ag14 -ag37 -ag36 -ag13 -ag40 -ag12 -aI01 -aI-8 -aI5 -ag41 -ag28 -ag37 -ag28 -ag14 -aI01 -aI-3 -aI3 -ag16 -ag36 -ag37 -aI01 -aI-6 -aI10 -ag41 -ag37 -ag42 -ag42 -ag13 -ag32 -ag13 -ag37 -ag40 -ag14 -aI01 -aI-9 -aI4 -ag30 -ag13 -ag40 -ag12 -aI01 -aI-3 -aI1 -ag37 -aI01 -aI-2 -aI2 -ag13 -ag40 -aI01 -aI1 -ag28 -aI01 -aI-3 -aI3 -ag15 -ag37 -ag40 -aI01 -aI-3 -aI9 -ag29 -ag38 -ag36 -ag37 -ag28 -ag28 -ag13 -ag41 -ag40 -aI01 -aI-7 -aI7 -ag16 -ag14 -ag31 -ag14 -ag13 -ag41 -ag40 -aI01 -aI2 -ag31 -ag34 -aI01 -aI-7 -aI2 -ag37 -ag36 -aI01 -aI-4 -aI6 -ag34 -ag37 -ag29 -ag37 -ag40 -ag14 -aI01 -aI-6 -aI5 -ag41 -ag40 -ag37 -ag40 -ag14 -aI01 -aI1 -ag28 -aI01 -aI-7 -aI1 -ag17 -aI01 -aI-1 -aI3 -ag29 -ag41 -ag40 -aI01 -aI-3 -aI1 -ag37 -aI01 -aI-2 -aI6 -ag34 -ag16 -ag29 -ag40 -ag31 -ag36 -aI01 -aI-5 -aI6 -ag34 -ag13 -ag28 -ag13 -ag41 -ag40 -aI01 -aI-6 -aI5 -ag41 -ag36 -ag13 -ag40 -ag12 -aI01 -aI-6 -aI9 -ag40 -ag32 -ag16 -ag36 -ag36 -ag37 -ag40 -ag32 -ag33 -aI01 -aI-8 -aI6 -ag40 -ag37 -ag32 -ag14 -ag37 -ag30 -aI01 -aI-6 -aI4 -aVq -p48 -ag16 -ag37 -ag36 -aI01 -aI-4 -aI5 -ag28 -ag16 -ag29 -ag37 -ag36 -aI01 -aI-4 -aI2 -ag37 -ag32 -aI01 -aI-3 -aI7 -ag14 -ag13 -ag12 -ag16 -ag41 -ag16 -ag28 -aI01 -aI-7 -aI3 -aVw -p49 -ag31 -ag33 -aI01 -aI1 -ag28 -aI01 -aI-4 -aI7 -ag35 -ag37 -ag36 -ag28 -ag13 -ag41 -ag40 -aI01 -aI-4 -aI1 -ag14 -aI01 -aI-3 -aI7 -ag41 -ag34 -ag16 -ag14 -ag13 -ag41 -ag40 -aI01 -aI2 -ag31 -ag34 -aI01 -aI-11 -aI5 -ag38 -ag36 -ag13 -ag29 -ag37 -aI01 -aI-5 -aI4 -ag28 -ag29 -ag41 -ag28 -aI01 -aI-3 -aI1 -ag14 -aI01 -aI-2 -aI6 -ag36 -ag31 -ag28 -ag13 -ag32 -ag45 -aI01 -aI-6 -aI3 -ag16 -ag40 -ag14 -aI01 -aI3 -ag13 -ag40 -ag12 -aI01 -aI-6 -aI3 -ag35 -ag37 -ag36 -aI01 -aI-4 -aI2 -ag38 -ag38 -aI01 -aI-2 -aI5 -ag28 -ag15 -ag31 -ag36 -ag38 -aI01 -aI-5 -aI11 -ag36 -ag33 -ag38 -ag14 -ag41 -ag12 -ag36 -ag31 -ag38 -ag15 -ag33 -aI01 -aI-10 -aI7 -ag41 -ag28 -ag28 -ag49 -ag41 -ag36 -ag30 -aI01 -aI-8 -aI2 -ag16 -ag14 -aI01 -aI4 -ag14 -ag13 -ag40 -ag12 -aI01 -aI-6 -aI4 -ag33 -ag32 -ag34 -ag37 -aI01 -aI-5 -aI1 -ag17 -aI01 -aI11 -ag31 -ag32 -ag45 -ag14 -ag36 -ag31 -ag32 -ag45 -ag13 -ag40 -ag12 -aI01 -aI-9 -aI5 -ag41 -ag40 -ag13 -ag31 -ag40 -aI01 -aI-6 -aI8 -ag17 -ag33 -ag34 -ag41 -ag40 -ag13 -ag31 -ag40 -aI01 -aI-8 -aI1 -ag12 -aI01 -aI-1 -aI5 -ag34 -ag31 -ag40 -ag32 -ag37 -aI01 -aI1 -ag30 -aI01 -aI-6 -aI5 -ag40 -ag45 -ag37 -ag36 -ag28 -aI01 -aI-5 -aI3 -ag28 -ag37 -ag30 -aI01 -aI-3 -aI3 -ag33 -ag37 -ag28 -aI01 -aI-4 -aI3 -ag37 -ag31 -ag30 -aI01 -aI-2 -aI2 -ag28 -ag14 -aI01 -aI-2 -aI5 -ag34 -ag34 -ag29 -ag31 -ag40 -aI01 -aI-5 -aI5 -ag14 -ag49 -ag37 -ag37 -ag40 -aI01 -aI-6 -aI10 -ag13 -ag32 -ag41 -ag40 -ag40 -ag37 -ag32 -ag14 -ag37 -ag30 -aI01 -aI-9 -aI5 -ag12 -ag12 -ag37 -ag28 -ag14 -aI01 -aI-5 -aI4 -ag40 -ag31 -ag36 -ag33 -aI01 -aI-3 -aI5 -ag41 -ag29 -ag13 -ag31 -ag34 -aI01 -aI-6 -aI7 -ag38 -ag31 -ag36 -ag14 -ag13 -ag14 -ag37 -aI01 -aI-7 -aI6 -ag36 -ag14 -ag15 -ag30 -ag31 -ag33 -aI01 -aI-6 -aI1 -ag14 -aI01 -aI1 -ag28 -aI01 -aI-1 -aI4 -ag41 -ag40 -ag13 -ag32 -aI01 -aI-6 -aI4 -ag34 -ag31 -ag32 -ag45 -aI01 -aI-3 -aI3 -ag41 -ag41 -ag29 -aI01 -aI-4 -aI3 -ag41 -ag31 -ag28 -aI01 -aI-2 -aI2 -ag12 -ag41 -aI01 -aI-2 -aI7 -ag34 -ag14 -aVz -p50 -ag29 -ag31 -ag40 -ag40 -aI01 -aI-7 -aI6 -ag41 -ag28 -ag14 -ag13 -ag40 -ag12 -aI01 -aI-5 -aI4 -ag34 -ag37 -ag31 -ag40 -aI01 -aI-5 -aI5 -ag36 -ag16 -ag35 -ag45 -ag31 -aI01 -aI-5 -aI6 -ag16 -ag40 -ag30 -ag13 -ag40 -ag12 -aI01 -aI-6 -aI4 -ag14 -ag14 -ag41 -ag29 -aI01 -aI-4 -aI3 -ag33 -ag37 -ag36 -aI01 -aI-3 -aI1 -ag44 -aI01 -aI-2 -aI4 -ag36 -ag31 -ag13 -ag40 -aI01 -aI-2 -aI5 -ag40 -ag32 -ag15 -ag37 -ag28 -aI01 -aI-6 -aI4 -ag13 -ag31 -ag40 -ag28 -aI01 -aI-3 -aI3 -ag30 -ag12 -ag37 -aI01 -aI1 -ag28 -aI01 -aI-5 -aI5 -ag37 -ag31 -ag30 -ag14 -ag15 -aI01 -aI-4 -aI6 -ag28 -ag37 -ag40 -ag15 -ag31 -ag29 -aI01 -aI-7 -aI2 -ag41 -ag40 -aI01 -aI-3 -aI6 -ag16 -ag13 -ag34 -ag30 -ag37 -ag36 -aI01 -aI-5 -aI4 -ag32 -ag45 -ag37 -ag14 -aI01 -aI-4 -aI4 -ag17 -ag17 -ag34 -ag37 -aI01 -aI-4 -aI4 -ag42 -ag42 -ag37 -ag36 -aI01 -aI-5 -aI1 -ag33 -aI01 -aI2 -ag14 -ag37 -aI01 -aI-4 -aI4 -ag37 -ag30 -ag13 -ag14 -aI01 -aI-2 -aI2 -ag12 -ag37 -aI01 -aI1 -ag28 -aI01 -aI-4 -aI7 -ag12 -ag33 -ag38 -ag14 -ag13 -ag31 -ag40 -aI01 -aI-6 -aI1 -ag12 -aI01 -aI-2 -aI8 -ag29 -ag17 -ag37 -ag30 -ag30 -ag13 -ag40 -ag12 -aI01 -aI-7 -aI2 -ag30 -ag37 -aI01 -aI-3 -aI5 -ag34 -ag13 -ag44 -ag13 -ag36 -aI01 -aI-3 -aI8 -ag29 -ag13 -ag40 -ag31 -ag14 -ag13 -ag41 -ag40 -aI01 -aI-9 -aI5 -ag37 -ag29 -ag37 -ag40 -ag14 -aI01 -aI3 -ag31 -ag36 -ag33 -aI01 -aI-9 -aI7 -ag40 -ag32 -ag41 -ag30 -ag13 -ag40 -ag12 -aI01 -aI-6 -aI7 -ag30 -ag13 -ag31 -ag40 -ag37 -ag28 -ag28 -aI01 -aI-6 -aI2 -ag37 -ag30 -aI01 -aI-4 -aI5 -ag48 -ag16 -ag31 -ag34 -ag28 -aI01 -aI-5 -aI11 -ag36 -ag31 -ag14 -ag41 -ag28 -ag14 -ag15 -ag37 -ag40 -ag37 -ag28 -aI01 -aI-10 -aI3 -ag41 -ag30 -ag37 -aI01 -aI-4 -aI4 -ag16 -ag34 -ag37 -ag36 -aI01 -aI3 -ag13 -ag31 -ag40 -aI01 -aI-7 -aI9 -ag35 -ag31 -ag34 -ag16 -ag31 -ag14 -ag13 -ag41 -ag40 -aI01 -aI-8 -aI5 -ag37 -ag40 -ag13 -ag40 -ag12 -aI01 -aI-6 -aI6 -ag44 -ag31 -ag29 -ag38 -ag34 -ag37 -aI01 -aI-5 -aI8 -ag38 -ag36 -ag37 -ag28 -ag28 -ag13 -ag41 -ag40 -aI01 -aI-7 -aI11 -ag41 -ag40 -ag37 -ag40 -ag14 -ag13 -ag31 -ag14 -ag13 -ag41 -ag40 -aI01 -aI-4 -aI1 -ag34 -aI01 -aI-9 -aI7 -ag32 -ag34 -ag16 -ag28 -ag13 -ag41 -ag40 -aI01 -aI-9 -aI5 -ag30 -ag31 -ag13 -ag34 -ag33 -aI01 -aI-3 -aI2 -ag14 -ag31 -aI01 -aI-3 -aI5 -ag17 -ag28 -ag32 -ag31 -ag40 -aI01 -aI-5 -aI8 -ag37 -ag31 -ag30 -ag34 -ag41 -ag32 -ag45 -ag28 -aI01 -aI-7 -aI6 -ag32 -ag13 -ag28 -ag13 -ag41 -ag40 -aI01 -aI-5 -aI10 -ag41 -ag29 -ag38 -ag41 -ag28 -ag13 -ag14 -ag13 -ag41 -ag40 -aI01 -aI-9 -aI4 -ag30 -ag13 -ag40 -ag12 -aI01 -aI-6 -aI4 -ag12 -ag36 -ag37 -ag37 -aI01 -aI-4 -aI2 -ag29 -ag41 -aI01 -aI-2 -aI6 -ag34 -ag31 -ag40 -ag40 -ag41 -ag33 -aI01 -aI-5 -aI3 -ag37 -ag14 -ag37 -aI01 -aI-4 -aI3 -ag38 -ag14 -ag15 -aI01 -aI-3 -aI4 -ag28 -ag13 -ag12 -ag40 -aI01 -aI-3 -aI4 -ag32 -ag37 -ag40 -ag14 -aI01 -aI-5 -aI10 -ag36 -ag31 -ag40 -ag12 -ag37 -ag29 -ag37 -ag40 -ag14 -ag28 -aI01 -aI-10 -aI4 -ag14 -ag37 -ag32 -ag14 -aI01 -aI-2 -aI9 -ag36 -ag29 -ag13 -ag40 -ag13 -ag28 -ag14 -ag13 -ag32 -aI01 -aI-5 -aI1 -ag37 -aI01 -aI-8 -aI2 -ag42 -ag31 -aI01 -aI-2 -aI7 -ag13 -ag31 -ag29 -ag37 -ag14 -ag37 -ag36 -aI01 -aI-4 -aI3 -ag41 -ag40 -ag30 -aI01 -aI-5 -aI3 -ag12 -ag13 -ag14 -aI01 -aI2 -ag31 -ag34 -aI01 -aI-2 -aI1 -ag28 -aI01 -aI-4 -aI9 -ag42 -ag42 -ag37 -ag36 -ag37 -ag40 -ag32 -ag37 -ag28 -aI01 -aI-9 -aI6 -ag39 -ag45 -ag28 -ag14 -ag36 -ag31 -aI01 -aI-6 -aI4 -ag34 -ag31 -ag14 -ag37 -aI01 -aI-4 -aI9 -ag41 -ag38 -ag15 -ag31 -ag40 -ag14 -ag13 -ag40 -ag37 -aI01 -aI-9 -aI3 -ag40 -ag13 -ag32 -aI01 -aI-1 -aI2 -ag40 -ag12 -aI01 -aI-4 -aI6 -ag28 -ag39 -ag41 -ag13 -ag40 -ag14 -aI01 -aI-5 -aI5 -ag14 -ag31 -ag40 -ag32 -ag37 -aI01 -aI-4 -aI7 -ag36 -ag13 -ag17 -ag16 -ag14 -ag37 -ag30 -aI01 -aI-9 -aI6 -ag36 -ag37 -ag32 -ag14 -ag37 -ag30 -aI01 -aI-6 -aI6 -ag35 -ag13 -ag28 -ag13 -ag41 -ag40 -aI01 -aI-4 -aI2 -ag30 -ag37 -aI01 -aI1 -ag30 -aI01 -aI-6 -aI5 -ag41 -ag16 -ag17 -ag34 -ag33 -aI01 -aI-1 -aI1 -ag37 -aI01 -aI-5 -aI2 -ag40 -ag31 -aI01 -aI-2 -aI1 -ag38 -aI01 -aI-1 -aI7 -ag36 -ag41 -ag38 -ag38 -ag13 -ag40 -ag12 -aI01 -aI-7 -aI3 -ag16 -ag38 -ag28 -aI01 -aI-3 -aI6 -ag33 -ag40 -ag31 -ag29 -ag13 -ag32 -aI01 -aI-7 -aI8 -ag12 -ag31 -ag16 -ag28 -ag28 -ag13 -ag31 -ag40 -aI01 -aI-6 -aI2 -ag29 -ag37 -aI01 -aI-3 -aI2 -ag32 -ag30 -aI01 -aI-2 -aI7 -ag37 -ag41 -ag29 -ag37 -ag14 -ag36 -ag33 -aI01 -aI-6 -aI8 -ag40 -ag37 -ag36 -ag31 -ag14 -ag13 -ag41 -ag40 -aI01 -aI-6 -aI3 -ag14 -ag13 -ag32 -aI01 -aI-6 -aI4 -ag13 -ag42 -ag14 -ag28 -aI01 -aI-4 -aI1 -ag41 -aI01 -aI-1 -aI4 -ag40 -ag41 -ag29 -ag37 -aI01 -aI-4 -aI4 -ag36 -ag31 -ag38 -ag15 -aI01 -aI3 -ag13 -ag32 -ag28 -aI01 -aI-5 -aI5 -ag30 -ag13 -ag37 -ag40 -ag14 -aI01 -aI-5 -aI3 -ag15 -ag31 -ag29 -aI01 -aI-4 -aI4 -ag16 -ag40 -ag30 -ag33 -aI01 -aI-4 -aI6 -ag37 -ag31 -ag14 -ag37 -ag28 -ag14 -aI01 -aI-5 -aI3 -ag37 -ag30 -ag33 -aI01 -aI-5 -aI5 -ag16 -ag13 -ag30 -ag37 -ag28 -aI01 -aI-5 -aI2 -ag33 -ag29 -aI01 -aI-3 -aI4 -ag42 -ag31 -ag28 -ag14 -aI01 -aI-2 -aI4 -ag32 -ag31 -ag30 -ag37 -aI01 -aI-3 -aI6 -ag14 -ag41 -ag36 -ag13 -ag31 -ag34 -aI01 -aI-2 -aI6 -ag50 -ag31 -ag14 -ag13 -ag41 -ag40 -aI01 -aI-7 -aI1 -ag33 -aI01 -aI-1 -aI1 -ag28 -aI01 -aI-5 -aI4 -ag34 -ag32 -ag41 -ag40 -aI01 -aI-5 -aI1 -ag46 -aI01 -aI-1 -aI5 -ag37 -ag36 -ag29 -ag31 -ag14 -aI01 -aI1 -ag28 -aI01 -aI-5 -aI6 -ag37 -ag30 -ag17 -ag31 -ag32 -ag45 -aI01 -aI-6 -aI3 -ag40 -ag32 -ag37 -aI01 -aI-2 -aI4 -ag49 -ag13 -ag32 -ag45 -aI01 -aI-6 -aI5 -ag13 -ag40 -ag13 -ag14 -ag37 -aI01 -aI-3 -aI1 -ag30 -aI01 -aI-2 -aI3 -ag36 -ag28 -ag14 -aI01 -aI-3 -aI7 -ag17 -ag41 -ag40 -ag31 -ag32 -ag32 -ag13 -aI01 -aI-7 -aI2 -ag34 -ag34 -aI01 -aI-1 -aI3 -ag14 -ag37 -ag36 -aI01 -aI1 -ag28 -aI01 -aI-5 -aI5 -ag42 -ag14 -ag37 -ag37 -ag40 -aI01 -aI-6 -aI3 -ag34 -ag13 -ag38 -aI01 -aI-2 -aI3 -ag31 -ag28 -ag15 -aI01 -aI-3 -aI4 -ag37 -ag16 -ag36 -ag33 -aI01 -aI-4 -aI3 -ag41 -ag33 -ag30 -aI01 -aI-2 -aI1 -ag49 -aI01 -aI-3 -aI2 -ag41 -ag36 -aI01 -aI4 -ag37 -ag28 -ag14 -ag28 -aI01 -aI-4 -aI1 -ag30 -aI01 -aI-2 -aI5 -ag16 -ag36 -ag13 -ag37 -ag36 -aI01 -aI-6 -aI7 -ag36 -ag31 -ag32 -ag14 -ag13 -ag41 -ag40 -aI01 -aI2 -ag31 -ag34 -aI01 -aI-5 -aI3 -ag31 -ag34 -ag28 -aI01 -aI-6 -aI2 -ag37 -ag37 -aI01 -aI-2 -aI2 -ag41 -ag29 -aI01 -aI-3 -aI4 -ag16 -ag50 -ag50 -ag33 -aI01 -aI-3 -aI7 -ag34 -ag45 -ag37 -ag36 -ag28 -ag41 -ag40 -aI01 -aI-7 -aI17 -ag40 -ag32 -ag14 -ag13 -ag41 -ag40 -ag31 -ag34 -ag43 -ag38 -ag31 -ag14 -ag14 -ag37 -ag36 -ag40 -ag28 -aI01 -aI-19 -aI2 -ag13 -ag38 -aI01 -aI-1 -aI1 -ag28 -aI01 -aI5 -ag41 -ag30 -ag31 -ag14 -ag31 -aI01 -aI-6 -aI4 -ag29 -ag31 -ag12 -ag37 -aI01 -aI-3 -aI1 -ag12 -aI01 -aI-2 -aI7 -ag14 -ag37 -ag36 -ag31 -ag14 -ag41 -ag36 -aI01 -aI-7 -aI1 -ag40 -aI01 -aI8 -ag32 -ag36 -ag37 -ag31 -ag28 -ag13 -ag40 -ag12 -aI01 -aI-8 -aI9 -ag30 -ag37 -ag38 -ag37 -ag40 -ag30 -ag37 -ag40 -ag14 -aI01 -aI-9 -aI3 -ag42 -ag13 -ag44 -aI01 -aI-2 -aI1 -ag41 -aI01 -aI-2 -aI5 -ag41 -ag36 -ag30 -ag37 -ag36 -aI01 -aI-5 -aI3 -ag38 -ag16 -ag14 -aI01 -aI-3 -aI7 -ag28 -ag37 -ag36 -ag14 -ag13 -ag41 -ag40 -aI01 -aI-6 -aI9 -ag14 -ag31 -ag34 -ag34 -ag31 -ag14 -ag13 -ag41 -ag40 -aI01 -aI-10 -aI3 -ag14 -ag36 -ag41 -aI01 -aI-2 -aI10 -ag37 -ag36 -ag38 -ag41 -ag34 -ag31 -ag14 -ag13 -ag41 -ag40 -aI01 -aI-8 -aI7 -ag28 -ag37 -ag32 -ag14 -ag13 -ag41 -ag40 -aI01 -aI-7 -aI3 -ag35 -ag31 -ag34 -aI01 -aI-4 -aI8 -ag34 -ag34 -ag13 -ag12 -ag37 -ag40 -ag32 -ag37 -aI01 -aI-8 -aI4 -ag12 -ag36 -ag31 -ag34 -aI01 -aI-3 -aI2 -ag37 -ag36 -aI01 -aI-5 -aI7 -ag35 -ag37 -ag36 -ag28 -ag13 -ag41 -ag40 -aI01 -aI-3 -aI1 -ag37 -aI01 -aI-2 -aI1 -ag14 -aI01 -aI-6 -aI22 -ag15 -ag13 -ag37 -ag36 -ag31 -ag32 -ag15 -ag13 -ag32 -ag31 -ag34 -ag43 -ag32 -ag34 -ag16 -ag28 -ag14 -ag37 -ag36 -ag13 -ag40 -ag12 -aI01 -aI-20 -aI2 -ag34 -ag34 -aI01 -aI7 -ag32 -ag34 -ag13 -ag29 -ag17 -ag37 -ag36 -aI01 -aI-10 -aI6 -ag16 -ag42 -ag42 -ag29 -ag31 -ag40 -aI01 -aI-6 -aI3 -ag37 -ag31 -ag38 -aI01 -aI-1 -aI2 -ag30 -ag28 -aI01 -aI-3 -aI4 -ag13 -ag12 -ag15 -ag14 -aI01 -aI-5 -aI3 -ag31 -ag28 -ag15 -aI01 -aI1 -ag28 -aI01 -aI-3 -aI9 -ag29 -ag13 -ag34 -ag14 -ag41 -ag40 -ag13 -ag31 -ag40 -aI01 -aI-8 -aI4 -ag29 -ag13 -ag40 -ag12 -aI01 -aI-5 -aI7 -ag34 -ag42 -ag38 -ag34 -ag31 -ag40 -ag37 -aI01 -aI-7 -aI3 -ag40 -ag41 -ag13 -aI01 -aI-4 -aI7 -ag41 -ag38 -ag32 -ag36 -ag41 -ag42 -ag14 -aI01 -aI-6 -aI4 -ag36 -ag40 -ag37 -ag36 -aI01 -aI-4 -aI12 -ag16 -ag12 -ag15 -ag14 -ag36 -ag31 -ag40 -ag28 -ag42 -ag41 -ag36 -ag29 -aI01 -aI-12 -aI6 -ag30 -ag12 -ag37 -ag29 -ag31 -ag40 -aI01 -aI-6 -aI3 -ag41 -ag45 -ag28 -aI01 -aI-5 -aI1 -ag45 -aI01 -aI4 -ag31 -ag33 -ag34 -ag37 -aI01 -aI-3 -aI3 -ag28 -ag31 -ag13 -aI01 -aI-3 -aI7 -ag36 -ag31 -ag14 -ag28 -ag16 -ag17 -ag31 -aI01 -aI-6 -aI1 -ag38 -aI01 -aI-1 -aI3 -ag12 -ag37 -ag36 -aI01 -aI-5 -aI5 -ag37 -ag33 -ag38 -ag31 -ag30 -aI01 -aI-4 -aI6 -ag36 -ag17 -ag41 -ag28 -ag32 -ag15 -aI01 -aI-7 -aI1 -ag30 -aI01 -aI-1 -aI2 -ag29 -ag38 -aI01 -aI-2 -aI5 -ag41 -ag14 -ag34 -ag13 -ag40 -aI01 -aI-5 -aI7 -ag40 -ag31 -ag38 -ag28 -ag31 -ag32 -ag45 -aI01 -aI-6 -aI4 -ag13 -ag12 -ag15 -ag14 -aI01 -aI-5 -aI6 -ag36 -ag16 -ag28 -ag45 -ag31 -ag34 -aI01 -aI-6 -aI3 -ag16 -ag15 -ag40 -aI01 -aI-2 -aI2 -ag14 -ag14 -aI01 -aI-3 -aI2 -ag14 -ag15 -aI01 -aI-3 -aI7 -ag39 -ag31 -ag32 -ag32 -ag31 -ag36 -ag30 -aI01 -aI-4 -aI3 -ag41 -ag17 -ag13 -aI01 -aI-4 -aI4 -ag36 -ag35 -ag13 -ag28 -aI01 -aI-4 -aI2 -ag35 -ag31 -aI01 -aI6 -ag28 -ag32 -ag36 -ag13 -ag38 -ag14 -aI01 -aI-9 -aI3 -ag16 -ag29 -ag38 -aI01 -aI-3 -aI6 -ag41 -ag15 -ag40 -ag28 -ag41 -ag40 -aI01 -aI-5 -aI6 -ag28 -ag37 -ag38 -ag15 -ag16 -ag28 -aI01 -aI-6 -aI1 -ag17 -aI01 -aI-3 -aI1 -ag29 -aI01 -aI2 -ag31 -ag32 -aI01 -aI4 -ag15 -ag13 -ag40 -ag37 -aI01 -aI1 -ag28 -aI01 -aI-6 -aI3 -ag12 -ag13 -ag32 -aI01 -aI-3 -aI2 -ag13 -ag40 -aI01 -aI-2 -aI2 -ag45 -ag37 -aI01 -aI-2 -aI6 -ag39 -ag41 -ag36 -ag13 -ag14 -ag33 -aI01 -aI-6 -aI6 -ag40 -ag31 -ag32 -ag15 -ag31 -ag36 -aI01 -aI-4 -aI6 -ag12 -ag37 -ag29 -ag37 -ag40 -ag14 -aI01 -aI-7 -aI9 -ag13 -ag38 -ag16 -ag34 -ag31 -ag14 -ag13 -ag41 -ag40 -aI01 -aI-10 -aI5 -ag38 -ag38 -ag13 -ag40 -ag12 -aI01 -aI-5 -aI3 -ag36 -ag32 -ag15 -aI01 -aI-3 -aI10 -ag14 -ag15 -ag37 -ag29 -ag31 -ag14 -ag13 -ag32 -ag31 -ag34 -aI01 -aI-9 -aI5 -ag32 -ag15 -ag13 -ag40 -ag12 -aI01 -aI-5 -aI3 -ag36 -ag13 -ag44 -aI01 -aI-3 -aI3 -ag34 -ag31 -ag17 -aI01 -aI-4 -aI1 -ag44 -aI01 -aI4 -ag13 -ag29 -ag16 -ag29 -aI01 -aI-5 -aI2 -ag50 -ag37 -aI01 -aI-3 -aI4 -ag37 -ag31 -ag40 -ag28 -aI01 -aI-3 -aI3 -ag36 -ag12 -ag37 -aI01 -aI-3 -aI4 -ag29 -ag41 -ag36 -ag33 -aI01 -aI-4 -aI4 -ag30 -ag13 -ag31 -ag40 -aI01 -aI11 -ag43 -ag41 -ag42 -ag43 -ag29 -ag37 -ag30 -ag13 -ag31 -ag40 -ag28 -aI01 -aI-15 -aI4 -ag14 -ag15 -ag41 -ag30 -aI01 -aI-5 -aI6 -ag13 -ag44 -ag14 -ag16 -ag36 -ag37 -aI01 -aI-5 -aI4 -ag36 -ag36 -ag41 -ag36 -aI01 -aI-4 -aI4 -ag34 -ag34 -ag37 -ag36 -aI01 -aI-4 -aI1 -ag40 -aI01 -aI4 -ag13 -ag29 -ag31 -ag44 -aI01 -aI-2 -aI2 -ag16 -ag29 -aI01 -aI-6 -aI1 -ag34 -aI01 -aI-1 -aI4 -ag41 -ag30 -ag37 -ag34 -aI01 -aI-2 -aI4 -ag16 -ag34 -ag31 -ag36 -aI01 -aI-5 -aI3 -ag41 -ag36 -ag37 -aI01 -aI-3 -aI6 -ag40 -ag13 -ag14 -ag41 -ag36 -ag28 -aI01 -aI-5 -aI2 -ag14 -ag37 -aI01 -aI-3 -aI1 -ag28 -aI01 -aI-1 -aI3 -ag36 -ag28 -ag37 -aI01 -aI-2 -aI4 -ag40 -ag13 -ag40 -ag12 -aI01 -aI-5 -aI2 -ag35 -ag37 -aI01 -aI-3 -aI2 -ag28 -ag14 -aI01 -aI-2 -aI4 -ag16 -ag34 -ag14 -ag13 -aI01 -aI9 -ag38 -ag34 -ag13 -ag32 -ag31 -ag14 -ag13 -ag41 -ag40 -aI01 -aI-7 -aI1 -ag33 -aI01 -aI-3 -aI3 -ag49 -ag31 -ag33 -aI01 -aI-6 -aI4 -ag14 -ag16 -ag31 -ag34 -aI01 -aI-6 -aI9 -ag34 -ag31 -ag38 -ag13 -ag40 -ag30 -ag36 -ag41 -ag29 -aI01 -aI-7 -aI7 -ag36 -ag12 -ag36 -ag31 -ag40 -ag12 -ag37 -aI01 -aI-5 -aI1 -ag37 -aI01 -aI2 -ag28 -ag14 -aI01 -aI-2 -aI1 -ag36 -aI01 -aI-4 -aI6 -ag40 -ag12 -ag14 -ag41 -ag40 -ag28 -aI01 -aI-7 -aI2 -ag32 -ag29 -aI01 -aI-2 -aI3 -ag37 -ag31 -ag38 -aI01 -aI-1 -aI2 -ag28 -ag14 -aI01 -aI-2 -aI5 -ag36 -ag40 -ag13 -ag40 -ag12 -aI01 -aI-6 -aI11 -ag44 -ag13 -ag32 -ag41 -ag12 -ag36 -ag31 -ag38 -ag15 -ag13 -ag32 -aI01 -aI-11 -aI3 -ag35 -ag37 -ag34 -aI01 -aI-1 -aI7 -ag40 -ag28 -ag15 -ag14 -ag37 -ag13 -ag40 -aI01 -aI-9 -aI14 -ag29 -ag38 -ag37 -ag34 -ag43 -ag50 -ag13 -ag35 -ag43 -ag49 -ag37 -ag34 -ag32 -ag15 -aI01 -aI-14 -aI2 -ag42 -ag14 -aI01 -aI3 -ag13 -ag28 -ag14 -aI01 -aI-6 -aI7 -ag13 -ag38 -ag41 -ag12 -ag36 -ag31 -ag29 -aI01 -aI-6 -aI2 -ag28 -ag38 -aI01 -aI-1 -aI1 -ag14 -aI01 -aI1 -ag28 -aI01 -aI-3 -aI2 -ag42 -ag37 -aI01 -aI-2 -aI4 -ag14 -ag14 -ag34 -ag37 -aI01 -aI-4 -aI2 -ag40 -ag37 -aI01 -aI2 -ag31 -ag36 -aI01 -aI-2 -aI4 -ag32 -ag34 -ag13 -ag38 -aI01 -aI-5 -aI3 -ag45 -ag37 -ag30 -aI01 -aI4 -ag34 -ag13 -ag28 -ag14 -aI01 -aI-7 -aI2 -ag16 -ag44 -aI01 -aI-4 -aI3 -ag41 -ag28 -ag28 -aI01 -aI1 -ag33 -aI01 -aI-1 -aI4 -ag34 -ag37 -ag28 -ag28 -aI01 -aI-6 -aI1 -ag12 -aI01 -aI5 -ag13 -ag28 -ag14 -ag13 -ag32 -aI01 -aI-5 -aI1 -ag28 -aI01 -aI-2 -aI4 -ag40 -ag37 -ag34 -ag33 -aI01 -aI-3 -aI4 -ag12 -ag37 -ag28 -ag14 -aI01 -aI-6 -aI4 -ag16 -ag32 -ag31 -ag28 -aI01 -aI-2 -aI2 -ag45 -ag33 -aI01 -aI-5 -aI8 -ag41 -ag17 -ag28 -ag37 -ag36 -ag35 -ag37 -ag36 -aI01 -aI-6 -aI5 -ag39 -ag37 -ag32 -ag14 -ag28 -aI01 -aI-6 -aI1 -ag42 -aI01 -aI-1 -aI2 -ag41 -ag38 -aI01 -aI-2 -aI1 -ag40 -aI01 -aI2 -ag37 -ag28 -aI01 -aI-2 -aI4 -ag34 -ag13 -ag40 -ag37 -aI01 -aI-5 -aI9 -ag38 -ag37 -ag36 -ag31 -ag14 -ag13 -ag41 -ag40 -ag28 -aI01 -aI-3 -aI2 -ag40 -ag12 -aI01 -aI-3 -aI2 -ag41 -ag36 -aI01 -aI-6 -aI5 -ag14 -ag13 -ag29 -ag31 -ag34 -aI01 -aI-6 -aI5 -ag36 -ag13 -ag12 -ag13 -ag40 -aI01 -aI-4 -aI3 -ag30 -ag37 -ag36 -aI01 -aI-4 -aI5 -ag16 -ag14 -ag38 -ag16 -ag14 -aI01 -aI-5 -aI4 -ag14 -ag15 -ag37 -ag36 -aI01 -aI-5 -aI1 -ag40 -aI01 -aI4 -ag31 -ag13 -ag35 -ag37 -aI01 -aI-4 -aI6 -ag37 -ag31 -ag36 -ag37 -ag28 -ag14 -aI01 -aI-5 -aI6 -ag13 -ag12 -ag15 -ag17 -ag41 -ag36 -aI01 -aI-1 -aI3 -ag16 -ag36 -ag28 -aI01 -aI-8 -aI4 -ag16 -ag36 -ag31 -ag34 -aI01 -aI-3 -aI4 -ag29 -ag31 -ag40 -ag40 -aI01 -aI-5 -aI5 -ag14 -ag49 -ag41 -ag36 -ag45 -aI01 -aI3 -ag13 -ag40 -ag12 -aI01 -aI-8 -aI4 -ag49 -ag29 -ag31 -ag40 -aI01 -aI-3 -aI3 -ag14 -ag41 -ag40 -aI01 -aI-4 -aI2 -ag44 -ag14 -aI01 -aI-3 -aI2 -ag13 -ag29 -aI01 -aI-2 -aI1 -ag41 -aI01 -aI4 -ag17 -ag13 -ag34 -ag13 -aI01 -aI-4 -aI2 -ag30 -ag37 -aI01 -aI-2 -aI14 -ag40 -ag30 -ag37 -ag14 -ag37 -ag36 -ag29 -ag13 -ag40 -ag13 -ag28 -ag14 -ag13 -ag32 -aI01 -aI-15 -aI2 -ag28 -ag29 -aI01 -aI-2 -aI5 -ag16 -ag29 -ag17 -ag37 -ag36 -aI01 -aI1 -ag28 -aI01 -aI-4 -aI4 -ag37 -ag36 -ag13 -ag32 -aI01 -aI2 -ag31 -ag34 -aI01 -aI-9 -aI1 -ag48 -aI01 -aI4 -ag16 -ag13 -ag32 -ag45 -aI01 -aI4 -ag15 -ag16 -ag34 -ag34 -aI01 -aI-7 -aI2 -ag31 -ag30 -aI01 -aI-2 -aI3 -ag37 -ag37 -ag40 -aI01 -aI-2 -aI2 -ag16 -ag37 -aI01 -aI-5 -aI4 -ag38 -ag31 -ag32 -ag45 -aI01 -aI9 -ag37 -ag14 -ag28 -ag40 -ag13 -ag42 -ag42 -ag37 -ag36 -aI01 -aI-11 -aI2 -ag13 -ag36 -aI01 -aI3 -ag13 -ag40 -ag12 -aI01 -aI-4 -aI2 -ag40 -ag14 -aI01 -aI-3 -aI9 -ag34 -ag13 -ag40 -ag30 -ag36 -ag41 -ag29 -ag13 -ag32 -aI01 -aI-2 -aI1 -ag37 -aI01 -aI-8 -aI8 -ag40 -ag30 -ag13 -ag12 -ag13 -ag14 -ag31 -ag34 -aI01 -aI-7 -aI4 -ag12 -ag36 -ag31 -ag29 -aI01 -aI-5 -aI4 -ag28 -ag32 -ag31 -ag34 -aI01 -aI-3 -aI5 -ag28 -ag49 -ag41 -ag36 -ag30 -aI01 -aI-6 -aI5 -ag36 -ag31 -ag30 -ag41 -ag44 -aI01 -aI-4 -aI13 -ag37 -ag40 -ag14 -ag15 -ag37 -ag28 -ag13 -ag50 -ag31 -ag14 -ag13 -ag41 -ag40 -aI01 -aI-13 -aI2 -ag14 -ag33 -aI01 -aI-1 -aI5 -ag13 -ag14 -ag13 -ag41 -ag40 -aI01 -aI3 -ag13 -ag40 -ag12 -aI01 -aI-3 -aI1 -ag28 -aI01 -aI-8 -aI2 -ag14 -ag15 -aI01 -aI1 -ag28 -aI01 -aI-2 -aI4 -ag14 -ag37 -ag36 -ag40 -aI01 -aI1 -ag28 -aI01 -aI-7 -aI6 -ag37 -ag31 -ag28 -ag31 -ag40 -ag14 -aI01 -aI-5 -aI8 -ag36 -ag32 -ag37 -ag38 -ag14 -ag36 -ag41 -ag40 -aI01 -aI-7 -aI8 -ag29 -ag16 -ag14 -ag31 -ag14 -ag13 -ag41 -ag40 -aI01 -aI1 -ag28 -aI01 -aI-9 -aI1 -ag34 -aI01 -aI-1 -aI4 -ag42 -ag37 -ag32 -ag14 -aI01 -aI-5 -aI6 -ag14 -ag37 -ag36 -ag28 -ag41 -ag40 -aI01 -aI-7 -aI2 -ag13 -ag38 -aI01 -aI-1 -aI8 -ag12 -ag37 -ag41 -ag40 -ag15 -ag41 -ag34 -ag37 -aI01 -aI-9 -aI11 -ag15 -ag13 -ag34 -ag41 -ag28 -ag41 -ag38 -ag15 -ag37 -ag36 -ag28 -aI01 -aI-10 -aI1 -ag38 -aI01 -aI-2 -aI6 -ag41 -ag13 -ag28 -ag28 -ag41 -ag40 -aI01 -aI-4 -aI3 -ag40 -ag14 -ag28 -aI01 -aI-4 -aI7 -ag28 -ag14 -ag41 -ag36 -ag30 -ag37 -ag36 -aI01 -aI-5 -aI3 -ag42 -ag13 -ag44 -aI01 -aI-5 -aI3 -ag36 -ag14 -ag31 -aI01 -aI-3 -aI6 -ag34 -ag33 -ag17 -ag13 -ag16 -ag28 -aI01 -aI-4 -aI3 -ag12 -ag41 -ag40 -aI01 -aI-3 -aI6 -ag40 -ag41 -ag29 -ag13 -ag31 -ag34 -aI01 -aI1 -ag28 -aI01 -aI-8 -aI3 -ag13 -ag32 -ag33 -aI01 -aI-4 -aI3 -ag49 -ag37 -ag36 -aI01 -aI3 -ag28 -ag37 -ag14 -aI01 -aI-7 -aI3 -ag36 -ag13 -ag29 -aI01 -aI5 -ag31 -ag34 -ag13 -ag14 -ag33 -aI01 -aI-5 -aI1 -ag37 -aI01 -aI-2 -aI5 -ag41 -ag36 -ag13 -ag14 -ag33 -aI01 -aI-5 -aI6 -ag40 -ag32 -ag13 -ag38 -ag31 -ag34 -aI01 -aI-5 -aI1 -ag14 -aI01 -aI3 -ag13 -ag40 -ag12 -aI01 -aI-6 -aI11 -ag37 -ag49 -ag13 -ag14 -ag14 -ag42 -ag13 -ag34 -ag14 -ag37 -ag36 -aI01 -aI-10 -aI7 -ag30 -ag13 -ag32 -ag14 -ag13 -ag41 -ag40 -aI01 -aI-7 -aI5 -ag41 -ag36 -ag30 -ag37 -ag36 -aI01 -aI-5 -aI3 -ag42 -ag13 -ag44 -aI01 -aI-4 -aI8 -ag41 -ag32 -ag37 -ag28 -ag28 -ag13 -ag40 -ag12 -aI01 -aI-7 -aI4 -ag17 -ag34 -ag37 -ag29 -aI01 -aI-4 -aI5 -ag30 -ag16 -ag32 -ag37 -ag36 -aI01 -aI-5 -aI8 -ag12 -ag36 -ag31 -ag29 -ag29 -ag13 -ag40 -ag12 -aI01 -aI-8 -aI4 -ag39 -ag37 -ag32 -ag14 -aI01 -aI-4 -aI7 -ag14 -ag37 -ag32 -ag14 -ag13 -ag41 -ag40 -aI01 -aI-7 -aI2 -ag44 -ag33 -aI01 -aI-4 -aI3 -ag16 -ag28 -ag15 -aI01 -aI-2 -aI4 -ag50 -ag50 -ag34 -ag37 -aI01 -aI-5 -aI10 -ag33 -ag14 -ag15 -ag31 -ag12 -ag41 -ag36 -ag37 -ag31 -ag40 -aI01 -aI-7 -aI2 -ag41 -ag40 -aI01 -aI-6 -aI1 -ag28 -aI01 -aI7 -ag31 -ag29 -ag38 -ag34 -ag13 -ag40 -ag12 -aI01 -aI-3 -aI1 -ag37 -aI01 -aI-3 -aI1 -ag37 -aI01 -aI-2 -aI6 -ag34 -ag37 -ag28 -ag29 -ag31 -ag40 -aI01 -aI-6 -aI1 -ag14 -aI01 -aI-2 -aI4 -ag32 -ag31 -ag34 -ag31 -aI01 -aI-2 -aI1 -ag40 -aI01 -aI-2 -aI8 -ag15 -ag37 -ag30 -ag16 -ag34 -ag13 -ag40 -ag12 -aI01 -aI-8 -aI5 -ag36 -ag13 -ag38 -ag14 -ag28 -aI01 -aI-6 -aI5 -ag37 -ag31 -ag36 -ag32 -ag15 -aI01 -aI-4 -aI2 -ag37 -ag45 -aI01 -aI-2 -aI5 -ag12 -ag29 -ag37 -ag40 -ag14 -aI01 -aI2 -ag37 -ag30 -aI01 -aI-7 -aI7 -ag34 -ag37 -ag32 -ag14 -ag13 -ag41 -ag40 -aI01 -aI-7 -aI8 -ag48 -ag16 -ag37 -ag40 -ag32 -ag13 -ag40 -ag12 -aI01 -aI-3 -aI1 -ag37 -aI01 -aI-6 -aI8 -ag38 -ag31 -ag36 -ag31 -ag14 -ag13 -ag40 -ag12 -aI01 -aI-8 -aI8 -ag36 -ag13 -ag31 -ag34 -ag13 -ag50 -ag37 -ag36 -aI01 -aI-7 -aI2 -ag35 -ag37 -aI01 -aI-3 -aI1 -ag14 -aI01 -aI-2 -aI4 -ag13 -ag37 -ag35 -ag37 -aI01 -aI-3 -aI2 -ag50 -ag37 -aI01 -aI-2 -aI8 -ag29 -ag13 -ag34 -ag31 -ag36 -ag13 -ag14 -ag33 -aI01 -aI-7 -aI5 -ag38 -ag28 -ag41 -ag40 -ag28 -aI01 -aI-6 -aI7 -ag12 -ag40 -ag31 -ag14 -ag16 -ag36 -ag37 -aI01 -aI-7 -aI4 -ag40 -ag12 -ag34 -ag33 -aI01 -aI-1 -aI4 -ag37 -ag14 -ag41 -ag40 -aI01 -aI-8 -aI2 -ag15 -ag31 -aI01 -aI3 -ag45 -ag37 -ag36 -aI01 -aI-4 -aI3 -ag37 -ag34 -ag34 -aI01 -aI-3 -aI5 -ag16 -ag42 -ag42 -ag34 -ag37 -aI01 -aI-5 -aI6 -ag41 -ag36 -ag14 -ag37 -ag28 -ag14 -aI01 -aI-7 -aI3 -ag45 -ag13 -ag38 -aI01 -aI-3 -aI7 -ag29 -ag31 -ag34 -ag34 -ag37 -ag28 -ag14 -aI01 -aI-7 -aI4 -ag34 -ag37 -ag37 -ag38 -aI01 -aI-4 -aI3 -ag41 -ag36 -ag14 -aI01 -aI3 -ag13 -ag40 -ag12 -aI01 -aI-3 -aI2 -ag37 -ag30 -aI01 -aI-4 -aI9 -ag17 -ag37 -ag34 -ag42 -ag13 -ag34 -ag14 -ag37 -ag36 -aI01 -aI-9 -aI6 -ag34 -ag30 -ag13 -ag37 -ag36 -ag28 -aI01 -aI-5 -aI13 -ag41 -ag35 -ag31 -ag33 -ag43 -ag28 -ag14 -ag36 -ag31 -ag28 -ag28 -ag37 -ag40 -aI01 -aI-13 -aI2 -ag35 -ag37 -aI01 -aI-3 -aI2 -ag42 -ag14 -aI01 -aI-3 -aI3 -ag48 -ag36 -ag14 -aI01 -aI-2 -aI6 -ag16 -ag31 -ag36 -ag13 -ag40 -ag12 -aI01 -aI-3 -aI1 -ag37 -aI01 -aI-5 -aI5 -ag38 -ag13 -ag36 -ag31 -ag34 -aI01 -aI-4 -aI3 -ag31 -ag32 -ag37 -aI01 -aI-2 -aI5 -ag40 -ag40 -ag13 -ag40 -ag12 -aI01 -aI-6 -aI3 -ag34 -ag13 -ag14 -aI01 -aI-2 -aI2 -ag31 -ag33 -aI01 -aI-3 -aI4 -ag15 -ag37 -ag36 -ag37 -aI01 -aI-5 -aI2 -ag16 -ag17 -aI01 -aI5 -ag31 -ag36 -ag36 -ag31 -ag33 -aI01 -aI-5 -aI8 -ag28 -ag37 -ag48 -ag16 -ag37 -ag40 -ag32 -ag37 -aI01 -aI-6 -aI1 -ag14 -aI01 -aI-2 -aI5 -ag14 -ag36 -ag13 -ag40 -ag12 -aI01 -aI-7 -aI4 -ag30 -ag41 -ag45 -ag16 -aI01 -aI-4 -aI4 -ag42 -ag42 -ag13 -ag44 -aI01 -aI-4 -aI1 -ag29 -aI01 -aI-1 -aI5 -ag38 -ag38 -ag41 -ag36 -ag14 -aI01 -aI-4 -aI10 -ag37 -ag36 -ag28 -ag37 -ag48 -ag16 -ag37 -ag40 -ag32 -ag37 -aI01 -aI-11 -aI8 -ag14 -ag15 -ag37 -ag36 -ag34 -ag31 -ag40 -ag30 -aI01 -aI-9 -aI4 -ag14 -ag31 -ag32 -ag45 -aI01 -aI3 -ag13 -ag40 -ag12 -aI01 -aI-5 -aI1 -ag36 -aI01 -aI-2 -aI5 -ag37 -ag13 -ag40 -ag37 -ag36 -aI01 -aI-4 -aI5 -ag37 -ag38 -ag37 -ag28 -ag14 -aI01 -aI-6 -aI1 -ag30 -aI01 -aI-1 -aI7 -ag13 -ag14 -ag32 -ag15 -ag13 -ag40 -ag12 -aI01 -aI-7 -aI8 -ag41 -ag32 -ag15 -ag31 -ag28 -ag14 -ag13 -ag32 -aI01 -aI-7 -aI3 -ag41 -ag12 -ag37 -aI01 -aI-4 -aI4 -ag36 -ag13 -ag40 -ag12 -aI01 -aI-3 -aI7 -ag16 -ag32 -ag14 -ag16 -ag36 -ag37 -ag28 -aI01 -aI-7 -aI3 -ag37 -ag31 -ag29 -aI01 -aI-2 -aI4 -ag40 -ag12 -ag14 -ag15 -aI01 -aI-5 -aI5 -ag31 -ag28 -ag28 -ag37 -ag40 -aI01 -aI-4 -aI2 -ag40 -ag30 -aI01 -aI-3 -aI5 -ag41 -ag40 -ag12 -ag34 -ag33 -aI01 -aI-6 -aI3 -ag33 -ag34 -ag37 -aI01 -aI-4 -aI4 -ag49 -ag13 -ag42 -ag14 -aI01 -aI-3 -aI2 -ag31 -ag38 -aI01 -aI3 -ag38 -ag37 -ag36 -aI01 -aI-6 -aI5 -ag33 -ag28 -ag14 -ag37 -ag29 -aI01 -aI-6 -aI5 -ag36 -ag31 -ag17 -ag13 -ag40 -aI01 -aI-3 -aI3 -ag30 -ag13 -ag44 -aI01 -aI-3 -aI2 -ag13 -ag34 -aI01 -aI-2 -aI2 -ag40 -ag45 -aI01 -aI-1 -aI3 -ag30 -ag41 -ag29 -aI01 -aI4 -ag13 -ag50 -ag37 -ag30 -aI01 -aI-8 -aI5 -ag38 -ag15 -ag28 -ag41 -ag40 -aI01 -aI-5 -aI1 -ag14 -aI01 -aI-2 -aI6 -ag37 -ag31 -ag30 -ag37 -ag36 -ag28 -aI01 -aI-5 -aI6 -ag32 -ag37 -ag40 -ag14 -ag34 -ag33 -aI01 -aI-6 -aI1 -ag30 -aI01 -aI-1 -aI8 -ag12 -ag36 -ag37 -ag28 -ag28 -ag13 -ag41 -ag40 -aI01 -aI-8 -aI2 -ag42 -ag28 -aI01 -aI-2 -aI7 -ag29 -ag31 -ag13 -ag40 -ag13 -ag40 -ag12 -aI01 -aI-6 -aI4 -ag41 -ag14 -ag37 -ag28 -aI01 -aI-3 -aI2 -ag35 -ag37 -aI01 -aI-4 -aI12 -ag38 -ag36 -ag37 -ag28 -ag37 -ag40 -ag14 -ag31 -ag14 -ag13 -ag41 -ag40 -aI01 -aI-11 -aI6 -ag37 -ag31 -ag14 -ag13 -ag40 -ag12 -aI01 -aI-6 -aI4 -ag34 -ag31 -ag32 -ag37 -aI01 -aI-5 -aI7 -ag28 -ag37 -ag36 -ag35 -ag41 -ag13 -ag36 -aI01 -aI-6 -aI7 -ag14 -ag36 -ag13 -ag32 -ag14 -ag37 -ag30 -aI01 -aI-8 -aI5 -ag35 -ag37 -ag36 -ag28 -ag37 -aI01 -aI-6 -aI4 -ag13 -ag12 -ag15 -ag14 -aI01 -aI-4 -aI4 -ag41 -ag17 -ag13 -ag40 -aI01 -aI-3 -aI1 -ag30 -aI01 -aI-1 -aI3 -ag29 -ag31 -ag40 -aI01 -aI-3 -aI2 -ag41 -ag14 -aI01 -aI-2 -aI2 -ag38 -ag37 -aI01 -aI-2 -aI6 -ag28 -ag31 -ag34 -ag13 -ag40 -ag30 -aI01 -aI-6 -aI5 -ag16 -ag14 -ag13 -ag40 -ag37 -aI01 -aI-4 -aI2 -ag40 -ag30 -aI01 -aI-3 -aI3 -ag14 -ag18 -ag22 -aI01 -aI-2 -aI3 -ag31 -ag14 -ag37 -aI01 -aI-5 -aI2 -ag28 -ag31 -aI01 -aI-2 -aI6 -ag16 -ag28 -ag28 -ag13 -ag31 -ag40 -aI01 -aI-4 -aI1 -ag14 -aI01 -aI-2 -aI2 -ag17 -ag33 -aI01 -aI-2 -aI2 -ag34 -ag37 -aI01 -aI-2 -aI3 -ag40 -ag12 -ag37 -aI01 -aI-2 -aI7 -ag40 -ag13 -ag40 -ag12 -ag45 -ag37 -ag33 -aI01 -aI-10 -aI5 -ag16 -ag28 -ag13 -ag40 -ag12 -aI01 -aI-3 -aI2 -ag37 -ag30 -aI01 -aI-3 -aI8 -ag14 -ag13 -ag34 -ag13 -ag14 -ag13 -ag37 -ag28 -aI01 -aI-3 -aI1 -ag33 -aI01 -aI-6 -aI5 -ag40 -ag13 -ag48 -ag16 -ag37 -aI01 -aI-3 -aI2 -ag41 -ag40 -aI01 -aI-3 -aI8 -ag32 -ag36 -ag16 -ag28 -ag14 -ag13 -ag42 -ag33 -aI01 -aI-7 -aI9 -ag34 -ag31 -ag28 -ag28 -ag13 -ag42 -ag13 -ag37 -ag30 -aI01 -aI-10 -aI8 -ag30 -ag13 -ag36 -ag37 -ag32 -ag14 -ag37 -ag30 -aI01 -aI-10 -aI1 -ag14 -aI01 -aI6 -ag31 -ag44 -ag13 -ag32 -ag31 -ag17 -aI01 -aI-5 -aI3 -ag28 -ag45 -ag28 -aI01 -aI-3 -aI4 -ag36 -ag39 -ag31 -ag40 -aI01 -aI-4 -aI3 -ag17 -ag34 -ag37 -aI01 -aI-3 -aI2 -ag12 -ag28 -aI01 -aI-3 -aI3 -ag37 -ag28 -ag14 -aI01 -aI1 -ag28 -aI01 -aI-3 -aI5 -ag36 -ag40 -ag31 -ag36 -ag33 -aI01 -aI-5 -aI9 -ag14 -ag36 -ag31 -ag15 -ag37 -ag30 -ag36 -ag41 -ag40 -aI01 -aI-10 -aI3 -ag13 -ag29 -ag37 -aI01 -aI-2 -aI4 -ag34 -ag13 -ag40 -ag12 -aI01 -aI-5 -aI1 -ag15 -aI01 -aI3 -ag13 -ag36 -ag30 -aI01 -aI-3 -aI4 -ag36 -ag13 -ag32 -ag37 -aI01 -aI-3 -aI5 -ag37 -ag31 -ag30 -ag37 -ag30 -aI01 -aI-4 -aI1 -ag37 -aI01 -aI-3 -aI1 -ag37 -aI01 -aI3 -ag41 -ag36 -ag33 -aI01 -aI-1 -aI2 -ag37 -ag29 -aI01 -aI-6 -aI1 -ag41 -aI01 -aI9 -ag38 -ag41 -ag34 -ag41 -ag12 -ag13 -ag32 -ag31 -ag34 -aI01 -aI-9 -aI7 -ag45 -ag37 -ag40 -ag13 -ag50 -ag37 -ag36 -aI01 -aI-7 -aI2 -ag16 -ag36 -aI01 -aI6 -ag40 -ag31 -ag29 -ag37 -ag40 -ag14 -aI01 -aI-8 -aI5 -ag14 -ag13 -ag37 -ag40 -ag14 -aI01 -aI-5 -aI3 -ag49 -ag37 -ag36 -aI01 -aI-4 -aI2 -ag28 -ag38 -aI01 -aI-2 -aI12 -ag36 -ag13 -ag31 -ag40 -ag12 -ag16 -ag34 -ag31 -ag14 -ag13 -ag41 -ag40 -aI01 -aI-7 -aI2 -ag34 -ag37 -aI01 -aI-5 -aI4 -ag38 -ag34 -ag37 -ag14 -aI01 -aI-4 -aI7 -ag17 -ag41 -ag40 -ag31 -ag32 -ag32 -ag13 -aI01 -aI-7 -aI1 -ag37 -aI01 -aI-1 -aI8 -ag30 -ag13 -ag31 -ag12 -ag41 -ag40 -ag31 -ag34 -aI01 -aI-9 -aI6 -ag31 -ag13 -ag34 -ag13 -ag40 -ag12 -aI01 -aI-5 -aI6 -ag35 -ag37 -ag36 -ag28 -ag31 -ag34 -aI01 -aI-4 -aI5 -ag34 -ag34 -ag13 -ag40 -ag12 -aI01 -aI-7 -aI7 -ag40 -ag28 -ag13 -ag14 -ag13 -ag35 -ag37 -aI01 -aI-5 -aI8 -ag38 -ag41 -ag28 -ag13 -ag14 -ag13 -ag41 -ag40 -aI01 -aI-8 -aI3 -ag42 -ag37 -ag36 -aI01 -aI-2 -aI3 -ag41 -ag36 -ag29 -aI01 -aI5 -ag31 -ag14 -ag13 -ag41 -ag40 -aI01 -aI-12 -aI3 -ag37 -ag31 -ag38 -aI01 -aI-2 -aI1 -ag37 -aI01 -aI1 -ag28 -aI01 -aI-4 -aI4 -ag49 -ag13 -ag32 -ag37 -aI01 -aI-3 -aI1 -ag41 -aI01 -aI-2 -aI9 -ag33 -ag38 -ag37 -ag28 -ag32 -ag36 -ag13 -ag38 -ag14 -aI01 -aI-10 -aI4 -ag49 -ag13 -ag14 -ag15 -aI01 -aI-2 -aI1 -ag40 -aI01 -aI4 -ag30 -ag41 -ag49 -ag28 -aI01 -aI-6 -aI3 -ag31 -ag33 -ag28 -aI01 -aI-2 -aI6 -ag36 -ag28 -ag15 -ag31 -ag34 -ag34 -aI01 -aI-5 -aI4 -ag40 -ag41 -ag32 -ag45 -aI01 -aI-6 -aI6 -ag36 -ag13 -ag14 -ag37 -ag36 -ag28 -aI01 -aI-6 -aI5 -ag37 -ag13 -ag12 -ag15 -ag14 -aI01 -aI2 -ag37 -ag30 -aI01 -aI-8 -aI1 -ag35 -aI01 -aI6 -ag13 -ag36 -ag14 -ag16 -ag31 -ag34 -aI01 -aI-5 -aI2 -ag37 -ag49 -aI01 -aI-2 -aI6 -ag12 -ag37 -ag40 -ag37 -ag36 -ag37 -aI01 -aI-7 -aI7 -ag31 -ag34 -ag13 -ag30 -ag31 -ag14 -ag37 -aI01 -aI-5 -aI2 -ag16 -ag37 -aI01 -aI-3 -aI1 -ag40 -aI01 -aI-2 -aI5 -ag37 -ag32 -ag14 -ag41 -ag36 -aI01 -aI-4 -aI6 -ag36 -ag14 -ag13 -ag32 -ag37 -ag28 -aI01 -aI-4 -aI2 -ag37 -ag44 -aI01 -aI-5 -aI2 -ag41 -ag40 -aI01 -aI-3 -aI1 -ag33 -aI01 -aI3 -ag37 -ag31 -ag36 -aI01 -aI-4 -aI1 -ag44 -aI01 -aI2 -ag41 -ag36 -aI01 -aI-3 -aI1 -ag50 -aI01 -aI5 -ag13 -ag12 -ag50 -ag31 -ag12 -aI01 -aI-5 -aI5 -ag37 -ag36 -ag41 -ag37 -ag28 -aI01 -absS'_sorted' -p51 -I00 -sb. \ No newline at end of file diff --git a/build/lib/openfalcon.egg-info/PKG-INFO b/build/lib/openfalcon.egg-info/PKG-INFO deleted file mode 100644 index 7616a83..0000000 --- a/build/lib/openfalcon.egg-info/PKG-INFO +++ /dev/null @@ -1,9 +0,0 @@ -Metadata-Version: 1.2 -Name: openfalcon -Version: 0.0.1 -Summary: UNKNOWN -Home-page: UNKNOWN -License: UNKNOWN -Description: UNKNOWN -Platform: UNKNOWN -Requires-Python: >3.5.2 diff --git a/build/lib/openfalcon.egg-info/SOURCES.txt b/build/lib/openfalcon.egg-info/SOURCES.txt deleted file mode 100644 index 4d6d14c..0000000 --- a/build/lib/openfalcon.egg-info/SOURCES.txt +++ /dev/null @@ -1,27 +0,0 @@ -MANIFEST.in -Pipfile -Pipfile.lock -README.md -setup.py -data/stats.md -data/stats.txt -dumps/catMap.p -dumps/category.json -dumps/trie.p -openfalcon.egg-info/PKG-INFO -openfalcon.egg-info/SOURCES.txt -openfalcon.egg-info/dependency_links.txt -openfalcon.egg-info/entry_points.txt -openfalcon.egg-info/requires.txt -openfalcon.egg-info/top_level.txt -services/__init__.py -services/category.py -services/code.py -services/getSearchResults.py -services/index.py -services/openfalcon.py -services/recommendationUtils.py -services/recommendations.py -services/search.py -services/stats.py -services/trie.py \ No newline at end of file diff --git a/build/lib/openfalcon.egg-info/dependency_links.txt b/build/lib/openfalcon.egg-info/dependency_links.txt deleted file mode 100644 index 8b13789..0000000 --- a/build/lib/openfalcon.egg-info/dependency_links.txt +++ /dev/null @@ -1 +0,0 @@ - diff --git a/build/lib/openfalcon.egg-info/entry_points.txt b/build/lib/openfalcon.egg-info/entry_points.txt deleted file mode 100644 index 027b0db..0000000 --- a/build/lib/openfalcon.egg-info/entry_points.txt +++ /dev/null @@ -1,3 +0,0 @@ -[console_scripts] -openfalcon = services.openfalcon:main - diff --git a/build/lib/openfalcon.egg-info/requires.txt b/build/lib/openfalcon.egg-info/requires.txt deleted file mode 100644 index 508ae09..0000000 --- a/build/lib/openfalcon.egg-info/requires.txt +++ /dev/null @@ -1,3 +0,0 @@ -argparse -gitpython -pygtrie diff --git a/build/lib/openfalcon.egg-info/top_level.txt b/build/lib/openfalcon.egg-info/top_level.txt deleted file mode 100644 index 8b13789..0000000 --- a/build/lib/openfalcon.egg-info/top_level.txt +++ /dev/null @@ -1 +0,0 @@ - diff --git a/build/lib/services/__init__.py b/build/lib/services/__init__.py deleted file mode 100755 index e69de29..0000000 diff --git a/build/lib/services/category.py b/build/lib/services/category.py deleted file mode 100755 index b4cac7d..0000000 --- a/build/lib/services/category.py +++ /dev/null @@ -1,45 +0,0 @@ -import os -import json - -repoDir = os.path.dirname(os.path.abspath(__file__)) +"/cosmos" -category = [] - -def dirParser(path): - dirs = path.split("/") - try: - if dirs[-2]== "test" or dirs[-2] == "src": - description = dirs[-3] + " " + dirs[-1] - elif dirs[-1]== "test" or dirs[-1] == "src": - description = dirs[-2] - else: - description = dirs[-2] + " " + dirs[-1] - except: - description = ' '.join(dirs) - - dirName = dirs[-1] - description = description.replace("_"," ") - dirName = dirName.replace("_"," ") - obj = { - "dirName" : dirName, - "description" : description - } - return obj -def path_to_json(path): - d = {'name': path} - if os.path.isdir(path): - parsedDetails = dirParser(os.path.join(path)) - location = os.path.join(path) - location = location.replace(repoDir,'') - temp = { - "description" : parsedDetails["description"], - "category" : parsedDetails["dirName"], - "location" : location - } - category.append(temp) - [path_to_json(os.path.join(path,x)) for x in os.listdir(path)] - return category - - -with open('dumps/category.json', 'w') as outfile: - json.dump(path_to_json(repoDir), outfile) - print("done") \ No newline at end of file diff --git a/build/lib/services/code.py b/build/lib/services/code.py deleted file mode 100755 index acf8fd9..0000000 --- a/build/lib/services/code.py +++ /dev/null @@ -1,93 +0,0 @@ -import json -import argparse -import os -import sys -import webbrowser -from . import getSearchResults -from . import recommendationUtils -import pathlib - - -ROOT_PATH = pathlib.Path(__file__).parents[1].as_posix() -category = json.load(open(ROOT_PATH+"/dumps/category.json", "r")) - - -def get_code(term, language, control): - # converts filesystem to a nested dict - dict_add = lambda x, y={}: dict_add(x[:-1], y).setdefault(x[-1], {}) if (x) else y - baseDict = {} - list( - map( - lambda x: dict_add(x, baseDict), - [path["location"].split("/") for path in category], - ) - ) - - searchResults = getSearchResults.getSearchResults(term) - print(searchResults) - term = searchResults[0]["location"].split("/")[-1] - - allPaths = [] - childPath = [] - recommendationUtils.getPath(term, baseDict, "", allPaths, childPath) - print(allPaths) - print(childPath) - if not len(childPath[0]): - path = searchResults[0]["location"] - path = "cosmos" + path - if not os.path.exists(path): - print("Clone the cosmos repo first into root of project") - sys.exit() - print(path) - arr = os.listdir(path) - print(arr) - if not language: - print("Available options") - for code in arr: - print(code.split(".")[-1]) - path = path + "/" + arr[0] - print(path) - if control == "open": - webbrowser.open(path) - else: - sys.exit() - - else: - for code in arr: - if code.split(".")[-1] == language: - print(code) - else: - print("similar categories") - for results in searchResults: - print(results["category"]) - - -def main(*args): - if len(args) == 0: - parser = argparse.ArgumentParser() - parser.add_argument("--term", help="The term to look for") - parser.add_argument( - "--language", default="cpp", help="enter the language extension" - ) - parser.add_argument( - "--control", - help="enter what to do with end file can be save,edit or delete", - ) - args = parser.parse_args() - term = args.term - language = args.language - control = args.control - else: - term = args[0] - language = args[1] - control = args[2] - - if not term: - print("Enter a valid term") - sys.exit() - - get_code(term, language, control) - - -if __name__ == "__main__": - main() diff --git a/build/lib/services/getSearchResults.py b/build/lib/services/getSearchResults.py deleted file mode 100755 index ea31f8e..0000000 --- a/build/lib/services/getSearchResults.py +++ /dev/null @@ -1,68 +0,0 @@ -import pickle -import collections -import json -import sys -import argparse -import pathlib -import time - -ROOT_PATH = pathlib.Path(__file__).parents[1].as_posix() -trie = pickle.load(open( ROOT_PATH + "/dumps/trie.p", "rb")) -catMap = pickle.load(open(ROOT_PATH + "/dumps/catMap.p", "rb")) -category = json.load(open(ROOT_PATH + "/dumps/category.json", "r")) - -def writeToJSONFile(path, fileName, data): - filePathNameWithExt = './' + path + '/' + fileName + '.json' - with open(filePathNameWithExt, 'w') as fp: - json.dump(data, fp) - -def getSearchResults(searchTerm, display=None): - """ - part of search.py script, which implements - functionality similar to grep -ir - """ - start = time.time() - path = './services' - fileName = 'search_output' - searchTerms = searchTerm.split() - results = [] - newResults = [] - jsonData = {} - jsonData['searchTearm'] = searchTerm - for terms in searchTerms: - terms = terms.lower() - if trie.get(terms): - for value in catMap[terms]: - results.append(value) - - counts = collections.Counter(results) - results = sorted(results, key=lambda x: -counts[x]) - searchResults = [] - [searchResults.append(x) for x in results if x not in searchResults] - - idx = 1 - if display: - for data in searchResults: - #print (category[data]['description']) - newResults.append(category[data]['description']) - results.append(category[data]) - idx = idx+1 - if idx>int(display): - print ("\n".join(newResults)) - jsonData['numResults'] = display - jsonData['results'] = newResults - end = time.time() - jsonData['timeTaken'] = end - start - writeToJSONFile(path, fileName, jsonData) - return results - - results = [] - newResults = [] - for data in searchResults: - newResults.append(category[data]['description']) - results.append(category[data]) - print ("\n".join(newResults)) - return results - - # if len(searchResults)==0: - # print "No results found for search" diff --git a/build/lib/services/index.py b/build/lib/services/index.py deleted file mode 100755 index d5b1a2c..0000000 --- a/build/lib/services/index.py +++ /dev/null @@ -1,27 +0,0 @@ -from git import Repo -import os -from pathlib import Path - - -class Cosmos: - def __init__(self, repo_url="https://github.com/OpenGenus/cosmos.git"): - self.git_url = repo_url - self.directory = "/" + self.git_url.split("/")[-1].split(".")[0] - self.repo_dir = os.path.dirname(os.path.abspath(__file__)) + self.directory - - def clone_repo(self): - p = Path(self.repo_dir) - if p.exists(): - return True - else: - try: - Repo.clone_from(self.git_url, self.repo_dir) - except Exception as e: - return False - print(e) - return True - - -if __name__ == "__main__": - cloner = Cosmos() - cloner.clone_repo() diff --git a/build/lib/services/openfalcon.py b/build/lib/services/openfalcon.py deleted file mode 100755 index 35f6c0f..0000000 --- a/build/lib/services/openfalcon.py +++ /dev/null @@ -1,96 +0,0 @@ -""" - ___ __ - ___ ___ ___ ___ / _/__ _/ /______ ___ -/ _ \/ _ \/ -_) _ \/ _/ _ `/ / __/ _ \/ _ | -\___/ .__/\__/_//_/_/ \_,_/_/\__/\___/_//_/ - /_/ - -An interface to all the services in falcon -""" - - -import argparse as arg -import sys -from . import search -from . import recommendations -from . import code -from . import stats -from . import index - - -def init_search_module_args(parser): - parser.add_argument( - "--search", help="Search for occurence of a term in Cosmos", type=str - ) - parser.add_argument("--results", help="Number of search results", type=int) - - -def init_recommendation_module_args(parser): - parser.add_argument("--recommend", help="The recommendation term") - parser.add_argument("--top", help="Number of results to show", type=int) - parser.add_argument("--type", help="Type of recommendation can be parent/child/all") - - -def init_code_module_args(parser): - parser.add_argument( - "--code", help="Delete/Edit the code sections", action="store_true" - ) - parser.add_argument("--term", help="The term to look for") - parser.add_argument("--language", help="Enter the language extension") - parser.add_argument( - "--control", help="Enter what to do with end file can be save,edit or delete" - ) - - -def init_stats_module_args(parser): - parser.add_argument( - "--stats", help="Generate statstics of Cosmos repo", action="store_true" - ) - parser.add_argument( - "-f", - "--format", - default="md", - help='Ouput can be "txt" for text file and "md" for markdown or "all" for all formats', - ) - - -def init_index_module_args(parser): - parser.add_argument( - "-c", "--clone", action="store_true", help="Clone the cosmos repo" - ) - - -def main(): - parser = arg.ArgumentParser("openfalcon") - init_search_module_args(parser) - init_recommendation_module_args(parser) - init_code_module_args(parser) - init_stats_module_args(parser) - init_index_module_args(parser) - args = parser.parse_args() - - if len(sys.argv) == 1: - print("Please refer to help section using openfalcon --help / openfalcon -h") - sys.exit() - - if args.clone: - c_repo = index.Cosmos() - if not c_repo.clone_repo(): - print("Clone the cosmos repo manually") - exit(0) - if args.stats: - stats.main(args.format) - exit(0) - if args.search: - # results arg can only be used when search arg is present - if args.results and (args.search is None): - parser.error("--results requires --search argument") - sys.exit() - search.main(args.search, args.results) - if args.recommend: - recommendations.main(args.recommend, args.top, args.type) - if args.code: - if args.term is None or args.language is None or args.control is None: - parser.error("--code requires --term --language and --control arguments") - sys.exit() - code.main(args.term, args.language, args.control) diff --git a/build/lib/services/recommendationUtils.py b/build/lib/services/recommendationUtils.py deleted file mode 100755 index e7bc554..0000000 --- a/build/lib/services/recommendationUtils.py +++ /dev/null @@ -1,61 +0,0 @@ -def getMaxDepth(l): - maxDepth = 1 - for data in l: - maxDepth = max(maxDepth,len(data.split("/"))) - return maxDepth - -def getMaxDepthofDict(d, level=1): - if not isinstance(d, dict) or not d: - return level - return max(getMaxDepthofDict(d[k], level + 1) for k in d) - -def getPath(element, JSON, path, allPaths,childPath): - if element in JSON: - path = path + element #+ str(JSON[element]) - # global childPath - childPath.append(JSON[element]) - # print(childPath) - # print path - allPaths.append(path) - for key in JSON: - if isinstance(JSON[key], dict): - getPath(element, JSON[key],path + key + '/',allPaths,childPath) - -def getParentWeightedList(l): - maxDepth = getMaxDepth(l) - parentWeights = [] - for i in range(0,maxDepth): - parentWeights.append([]) - for data in l: - i=0 - for path in data.split("/"): - parentWeights[i].append(path) - i=i+1 - return parentWeights - -def getChildWeightedList(childPath): - try: - maxDepth = getMaxDepthofDict(childPath) - # print maxDepth - childWeights = [] - for i in range(0,maxDepth): - childWeights.append([]) - - for r, s in childPath.items(): - i=0 - q = [] - p = r - while True: - for k, v in s.items(): - # print('(%s,%s) ' % ('ROOT' if p == r else p, k)) - # if k != "test" and k != "src": - # print k.replace('_',' ') - childWeights[i].append(k) - if v: - q.append((k, v)) - if not q: - break - p, s = q.pop(0) - return childWeights - except: - return [] diff --git a/build/lib/services/recommendations.py b/build/lib/services/recommendations.py deleted file mode 100755 index d301678..0000000 --- a/build/lib/services/recommendations.py +++ /dev/null @@ -1,100 +0,0 @@ -import json -import argparse -import sys -from . import getSearchResults -from . import recommendationUtils -import pathlib - -ROOT_PATH = pathlib.Path(__file__).parents[1].as_posix() -category = json.load(open(ROOT_PATH+"/dumps/category.json", "r")) - - -def get_recommendation(searchResults, recTerm, top, types): - recTerm = searchResults[0]["location"].split("/")[-1] - # print recTerm - # converts filesystem to a nested dict - dict_add = lambda x, y={}: dict_add(x[:-1], y).setdefault(x[-1], {}) if (x) else y - baseDict = {} - list( - map( - lambda x: dict_add(x, baseDict), - [path["location"].split("/") for path in category], - ) - ) - - allPaths = [] - childPath = [] - recommendationUtils.getPath(recTerm, baseDict, "", allPaths, childPath) - if len(childPath) > 0: - childPath = childPath[0] - # print(allPaths) - # print(getMaxDepth(allPaths)) - recDict = [] - - print("childPath") - print(childPath) - if types != "child": - print("parent") - parentWeights = recommendationUtils.getParentWeightedList(allPaths) - maxParentWeight = len(parentWeights) - for parents in parentWeights: - for parent in parents: - recDict.append({parent: maxParentWeight}) - maxParentWeight = maxParentWeight - 1 - - # print childPath - if types != "parent": - childWeights = recommendationUtils.getChildWeightedList(childPath) - maxChildWeight = len(childWeights) + 1 - - for childs in childWeights: - for child in childs: - recDict.append({child: maxChildWeight}) - maxChildWeight = maxChildWeight - 1 - # print childWeights - - finalRecDict = sorted(recDict, key=lambda x: list(x.values()), reverse=True) - if top: - for i in range(0, int(top)): - print((finalRecDict[i])) - else: - for data in finalRecDict: - print(data) - - -def main(*args): - if len(args) == 0: - parser = argparse.ArgumentParser() - parser.add_argument("--recommend", help="The recommendation term") - parser.add_argument("--top", help="Number of results to show") - parser.add_argument( - "--type", help="type of recommendation can be parent/child/all" - ) - args = parser.parse_args() - recTerm = args.recommend - top = args.top - types = args.type - else: - recTerm = args[0] - top = args[1] - types = args[2] - - if recTerm == None: - print("please enter a term to get recommendation") - sys.exit() - - if types != "parent" and types != "all" and types != "child": - print("please enter correct type which can be child/parent/all") - sys.exit() - - searchResults = getSearchResults.getSearchResults(recTerm, None) - - if len(searchResults) == 0: - print("Nothing to recommend") - sys.exit() - - get_recommendation(searchResults, recTerm, top, types) - - -if __name__ == "__main__": - main() diff --git a/build/lib/services/search.py b/build/lib/services/search.py deleted file mode 100755 index 066d426..0000000 --- a/build/lib/services/search.py +++ /dev/null @@ -1,30 +0,0 @@ -import sys -import argparse -from . import getSearchResults - - -def main(*args): - """ - similar to grep -ir "term" in cosmos repo, - we try to find sentences having the given term - and display n-number of results - """ - if len(args) == 0: - parser = argparse.ArgumentParser() - parser.add_argument("--search", help="The search term") - parser.add_argument("--results", help="Required number of results") - args = parser.parse_args() - searchTerm = args.search - display = args.results - else: - searchTerm = args[0] - display = args[1] - if searchTerm == None: - print("Enter a valid Search Term") - sys.exit() - - print(getSearchResults.getSearchResults(searchTerm, display)) - - -if __name__ == "__main__": - main() diff --git a/build/lib/services/stats.py b/build/lib/services/stats.py deleted file mode 100755 index a690522..0000000 --- a/build/lib/services/stats.py +++ /dev/null @@ -1,304 +0,0 @@ -#!/usr/bin/env python3 - -import collections -import itertools -import pathlib -import argparse -import os -from datetime import datetime -from . import index - -paths = [] -suffixes=set() -name_max_len=0 -suffix_max_len=0 -totals = collections.defaultdict(int) -group_stats = collections.defaultdict(int) -last_group=None -sort_key=None -extension_map=dict() -original_paths = [] - -def init_globals(): - global paths, suffixes, name_max_len, suffix_max_len, totals, group_stats, last_group, sort_key,extension_map,original_paths - Path = collections.namedtuple("Entry", ("suffix", "group", "name")) - avoid_extensions = [ - "", - ".md", - ".png", - ".csv", - ".class", - ".data", - ".in", - ".jpeg", - ".jpg", - ".out", - ".textclipping", - ".properties", - ".txt", - ".sbt", - ] - avoid_dirs = ["project", "test", "img", "image", "images"] - paths = [] - original_paths = [] - for path in pathlib.Path(__file__).parents[0].joinpath("cosmos").glob("code/**/**/*"): - k = path.as_posix().split('/').index('code') - path = pathlib.Path("/".join(path.as_posix().split('/')[k:])) - if ( - path.suffix - and not any(elem in list(path.parts) for elem in avoid_dirs) - and path.suffix.lower() not in avoid_extensions - ): - original_paths.append(path.parts) - paths.append( - Path( - suffix=path.suffix.lstrip(".").lower(), - group=path.parts[1].replace("-", " ").replace("_", " "), - name=path.parts[-2].replace("-", " ").replace("_", " "), - ) - ) - - suffixes = {path.suffix for path in paths} - suffixes = sorted(suffixes - set(avoid_extensions)) - extension_map = { - "adb": "Ada", - "bf": "BrainFuck", - "c": "C", - "clj": "Clojure", - "cpp": "C++", - "cr": "Crisp", - "cs": "Visual C#", - "elm": "Elm", - "erl": "Erlang", - "ex": "Elixir", - "exs": "Elixir", - "f": "Fortran", - "fs": "Visual F#", - "go": "Golang", - "h": "C", - "hpp": "C++", - "hs": "Haskell", - "htm": "HTML", - "html": "HTML", - "ipynb": "Jupyter Notebook", - "java": "Java", - "jl": "Julia", - "js": "JavaScript", - "kt": "Kotlin", - "lua": "Lua", - "m": "Objective-C", - "ml": "ML", - "nim": "Nim", - "pde": "Processing Development Environment", - "php": "PHP", - "pl": "Perl", - "purs": "PureScript", - "py": "Python", - "rb": "Ruby", - "re": "Reason", - "rkt": "Racket", - "rs": "Rust", - "ruby": "Ruby", - "sc": "Scala", - "scala": "Scala", - "sh": "Shell Script", - "sml": "Standard ML", - "swift": "Swift", - "ts": "TypeScript", - "vb": "Visual Basic", - } - suffix_with_lang_name = set() - for ext in suffixes: - lang = extension_map.get(ext, ext.upper()) - suffix_with_lang_name.add(lang) - suffixes = list(sorted(suffix_with_lang_name)) - - name_max_len = max(max(len(path.group), len(path.name)) for path in paths) - suffix_max_len = max(len(suffix) for suffix in suffixes) - - totals = collections.defaultdict(int) - group_stats = collections.defaultdict(int) - last_group = None - sort_key = lambda path: (path.group, path.name) # noqa - paths = sorted(paths, key=sort_key) - - -def generate_txt(): - global paths, suffixes, name_max_len, suffix_max_len, totals, group_stats, last_group, sort_key,extension_map,original_paths - - print( - "This is the progress list of Cosmos | Updated on: {}".format( - datetime.today().strftime("%Y-%m-%d") - ) - ) - print() - - def print_group_stats(): - if group_stats: - print(" " * name_max_len, end=" ") - for suffix in suffixes: - print("-" * (suffix_max_len + 1), end=" ") - print() - print(" " * name_max_len, end=" ") - for suffix in suffixes: - print(str(group_stats[suffix]).rjust(suffix_max_len), end=" ") - print() - print() - - for (group, name), g in itertools.groupby(paths, key=sort_key): - if group != last_group: - print_group_stats() - print() - print(group.upper().ljust(name_max_len), end=" ") - for suffix in suffixes: - print(suffix.rjust(suffix_max_len), end=" ") - print() - print("-" * name_max_len, end="- ") - for suffix in suffixes: - print("-" * (suffix_max_len + 1), end=" ") - print() - last_group = group - group_stats = collections.defaultdict(int) - - print(name.ljust(name_max_len), end=" ") - alg_suffixes = {extension_map[p.suffix] for p in g} - for suffix in suffixes: - if suffix in alg_suffixes: - totals[suffix] += 1 - group_stats[suffix] += 1 - value = "x" - else: - value = "." - print(value.rjust(suffix_max_len), end=" ") - print() - - print_group_stats() - - print() - print("=" * name_max_len, end="= ") - for suffix in suffixes: - print("=" * (suffix_max_len + 1), end=" ") - print() - print("TOTALS:".rjust(name_max_len), end=" ") - for suffix in suffixes: - print(str(totals[suffix]).rjust(suffix_max_len), end=" ") - print() - - -def generate_markdown(): - global paths, suffixes, name_max_len, suffix_max_len, totals, group_stats, last_group, sort_key,extension_map,original_paths - - print( - "This is the progress list of [Cosmos](https://github.com/OpenGenus/cosmos/) | Updated on: {}".format( - datetime.today().strftime("%Y-%m-%d") - ) - ) - print() - - def print_group_stats(): - if group_stats: - print("| |", end="") - for suffix in suffixes: - print( - " {} |".format(str(group_stats[suffix]).rjust(suffix_max_len)), - end="", - ) - print() - print() - - for (group, name), g in itertools.groupby(paths, key=sort_key): - if group != last_group: - print_group_stats() - print() - category_dir = group.replace(" ", "_") - print( - "# [{}](https://github.com/OpenGenus/cosmos/tree/master/code/{})".format( - group.upper(), category_dir - ) - ) - print("| {} | ".format(group.upper().ljust(name_max_len)), end=" ") - for suffix in suffixes: - print("{} | ".format(suffix.rjust(suffix_max_len)), end=" ") - print() - print("| ", end="") - print("-" * name_max_len, end="- | ") - for suffix in suffixes: - print("-" * (suffix_max_len + 1), end=" | ") - print() - last_group = group - group_stats = collections.defaultdict(int) - - original_name = name.replace(" ", "_") - name_path = "" - for x in original_paths: - if x[-2] == original_name: - name_path = "https://github.com/OpenGenus/cosmos/tree/master/{}".format( - "".join([y + "/" for pos, y in enumerate(x) if pos != len(x) - 1]) - ) - break - - print("| [{}]({}) |".format(name, name_path), end=" ") - alg_suffixes = {extension_map[p.suffix] for p in g} - for suffix in suffixes: - if suffix in alg_suffixes: - totals[suffix] += 1 - group_stats[suffix] += 1 - value = "✔️" - else: - value = "." - print(" {} | ".format(value), end=" ") - print() - - print() - print() - tot_str = "TOTALS" - print("| {} |".format(tot_str), end=" ") - for suffix in suffixes: - print(" {} |".format(str(totals[suffix]).rjust(suffix_max_len)), end=" ") - print() - print("| ", end="") - print("-" * len(tot_str), end=" | ") - for suffix in suffixes: - print("-" * (suffix_max_len + 1), end=" | ") - print() - - -def main(*args): - #for x in pathlib.Path(__file__).parents[0].joinpath("cosmos").glob("code/**/**/*"): - # k = x.as_posix().split('/').index('code') - # y = pathlib.Path("/".join(x.as_posix().split('/')[k:])) - # print(y.as_posix()) - #exit(0) - c_repo = index.Cosmos() - if not c_repo.clone_repo(): - print("Clone the cosmos repo manually") - exit(0) - - init_globals() - - if len(args) == 0: - parser = argparse.ArgumentParser( - description="Get statstics in txt or markdown. Make sure you are in root of cosmos repo before running" - ) - parser.add_argument( - "-f", - "--format", - help='Ouput can be "txt" for text file and "md" for markdown or "all" for all formats', - default="txt", - ) - results = parser.parse_args() - choice = results.format - else: - choice = args[0] - - if choice == "txt": - generate_txt() - elif choice == "md": - generate_markdown() - else: - generate_txt() - generate_markdown() - - -if __name__ == "__main__": - main() diff --git a/build/lib/services/trie.py b/build/lib/services/trie.py deleted file mode 100755 index 031b326..0000000 --- a/build/lib/services/trie.py +++ /dev/null @@ -1,24 +0,0 @@ -import pygtrie -import json -import pickle - -category = json.load( open( "dumps/category.json", "r" ) ) -trie = pygtrie.CharTrie() -catMap = dict() -idx = int(0) -for data in category: - description = data["description"] - for word in description.split(): - word = word.lower() - trie[word] = True - if catMap.has_key(word): - catMap[word].append(idx) - else: - catMap[word] = [] - catMap[word].append(idx) - idx= idx +1 -pickle.dump( trie, open( "dumps/trie.p", "wb" )) -pickle.dump( catMap, open( "dumps/catMap.p","wb")) -# to load back -# u = pickle.load( open( "trie.p", "rb" ) ) to load back -# u = pickle.load( open( "dumps/catMap.json", "r" ) ) \ No newline at end of file diff --git a/dist/openfalcon-0.0.1-py3-none-any.whl b/dist/openfalcon-0.0.1-py3-none-any.whl deleted file mode 100644 index 400d7c6..0000000 Binary files a/dist/openfalcon-0.0.1-py3-none-any.whl and /dev/null differ diff --git a/dist/openfalcon-0.0.1.tar.gz b/dist/openfalcon-0.0.1.tar.gz deleted file mode 100644 index 37e8cd4..0000000 Binary files a/dist/openfalcon-0.0.1.tar.gz and /dev/null differ diff --git a/openfalcon.egg-info/PKG-INFO b/openfalcon.egg-info/PKG-INFO deleted file mode 100644 index 7616a83..0000000 --- a/openfalcon.egg-info/PKG-INFO +++ /dev/null @@ -1,9 +0,0 @@ -Metadata-Version: 1.2 -Name: openfalcon -Version: 0.0.1 -Summary: UNKNOWN -Home-page: UNKNOWN -License: UNKNOWN -Description: UNKNOWN -Platform: UNKNOWN -Requires-Python: >3.5.2 diff --git a/openfalcon.egg-info/SOURCES.txt b/openfalcon.egg-info/SOURCES.txt deleted file mode 100644 index 4d6d14c..0000000 --- a/openfalcon.egg-info/SOURCES.txt +++ /dev/null @@ -1,27 +0,0 @@ -MANIFEST.in -Pipfile -Pipfile.lock -README.md -setup.py -data/stats.md -data/stats.txt -dumps/catMap.p -dumps/category.json -dumps/trie.p -openfalcon.egg-info/PKG-INFO -openfalcon.egg-info/SOURCES.txt -openfalcon.egg-info/dependency_links.txt -openfalcon.egg-info/entry_points.txt -openfalcon.egg-info/requires.txt -openfalcon.egg-info/top_level.txt -services/__init__.py -services/category.py -services/code.py -services/getSearchResults.py -services/index.py -services/openfalcon.py -services/recommendationUtils.py -services/recommendations.py -services/search.py -services/stats.py -services/trie.py \ No newline at end of file diff --git a/openfalcon.egg-info/dependency_links.txt b/openfalcon.egg-info/dependency_links.txt deleted file mode 100644 index 8b13789..0000000 --- a/openfalcon.egg-info/dependency_links.txt +++ /dev/null @@ -1 +0,0 @@ - diff --git a/openfalcon.egg-info/entry_points.txt b/openfalcon.egg-info/entry_points.txt deleted file mode 100644 index 027b0db..0000000 --- a/openfalcon.egg-info/entry_points.txt +++ /dev/null @@ -1,3 +0,0 @@ -[console_scripts] -openfalcon = services.openfalcon:main - diff --git a/openfalcon.egg-info/requires.txt b/openfalcon.egg-info/requires.txt deleted file mode 100644 index 508ae09..0000000 --- a/openfalcon.egg-info/requires.txt +++ /dev/null @@ -1,3 +0,0 @@ -argparse -gitpython -pygtrie diff --git a/openfalcon.egg-info/top_level.txt b/openfalcon.egg-info/top_level.txt deleted file mode 100644 index 8b13789..0000000 --- a/openfalcon.egg-info/top_level.txt +++ /dev/null @@ -1 +0,0 @@ - diff --git a/services/openfalcon.py b/services/openfalcon.py index 35f6c0f..a2ce943 100755 --- a/services/openfalcon.py +++ b/services/openfalcon.py @@ -11,12 +11,18 @@ import argparse as arg import sys +import json +import time from . import search from . import recommendations from . import code from . import stats from . import index +def writeToJSONFile(fileName, data): + target = fileName + '.json' + with open(target, 'a+') as fp: + json.dump(data, fp) def init_search_module_args(parser): parser.add_argument( @@ -69,6 +75,14 @@ def main(): init_index_module_args(parser) args = parser.parse_args() + argparse_dict = vars(args) + t = time.time() + fileName = 'log' + jsonData = {} + jsonData['Time'] = t + jsonData['Command'] = argparse_dict + writeToJSONFile(fileName, jsonData) + if len(sys.argv) == 1: print("Please refer to help section using openfalcon --help / openfalcon -h") sys.exit()