Gabriel Cordier's repositories
FunctionalAnalysis
Solutions to some exercises from Walter Rudin's Functional Analysis
bellingcat
Code from Bellingcat's guide
ReversePolishNotationParser
Parses then computes RPN expressions. Iterative algorithm, not the naive one! Problem originated from http://codingdojo.org/kata/. Further reading at https://en.wikipedia.org/wiki/Reverse_Polish_notation
MarkdownToLaTeX
Markdown to LaTeX
Language:PythonMIT000
minimal_length_of_graph_traversal
Given a network, equipped with a specific total and strict order, we get the minimal "round trip" traversal length. It always converges, at quadratic cost.
TheChemicalBrowsers
Given a chemical formula, find how many H, He, Li, Be, B, C, N, ... are involved. Iterative algorithm, not the naive one!
Language:TLACC0-1.0000