Pinned Repositories
battledev
Solutions to battledev problems
bellingcat
Code from Bellingcat's guide
FunctionalAnalysis
Solutions to some exercises from Walter Rudin's Functional Analysis
gitcordier
MarkdownToLaTeX
Markdown to LaTeX
md2latex
Markdown to LaTeX. Specs in TLA+
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.
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
selenium
Web scraping with Selenium
TheChemicalBrowsers
Given a chemical formula, find how many H, He, Li, Be, B, C, N, ... are involved. Iterative algorithm, not the naive one!
gitcordier's Repositories
gitcordier/FunctionalAnalysis
Solutions to some exercises from Walter Rudin's Functional Analysis
gitcordier/bellingcat
Code from Bellingcat's guide
gitcordier/md2latex
Markdown to LaTeX. Specs in TLA+
gitcordier/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
gitcordier/battledev
Solutions to battledev problems
gitcordier/gitcordier
gitcordier/MarkdownToLaTeX
Markdown to LaTeX
gitcordier/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.
gitcordier/selenium
Web scraping with Selenium
gitcordier/stack_qalculator
gitcordier/TheChemicalBrowsers
Given a chemical formula, find how many H, He, Li, Be, B, C, N, ... are involved. Iterative algorithm, not the naive one!
gitcordier/tlaplus