Snippets created by Fabio Galuppo
-
A minimalist XML Parser
A minimalist XML Parser
11 people like this
Like the snippet!Posted: 11 years ago by Fabio Galuppo
-
Missionaries and Cannibals Problem and its state space tree
Generating a state space tree to the Missionaries and Cannibals Problem (http://en.wikipedia.org/wiki/Missionaries_and_cannibals_problem). Then, this tree is iterated with depth-first approach, printing all the visitations. The solutions to problem have a depth equals 9.
13 people like this
Like the snippet!Posted: 10 years ago by Fabio Galuppo
-
Print a calendar
How to print a formatted calendar to the console using F#
12 people like this
Like the snippet!Posted: 9 years ago by Fabio Galuppo
-
Inverse Gamma function and Inverse Factorial by Approximation
Inverse Gamma function and Inverse Factorial by Approximation based on these references: http://mathforum.org/kb/message.jspa?messageID=342551&tstart=0 https://github.com/DarkoVeberic/LambertW
2 people like this
Like the snippet!Posted: 9 years ago by Fabio Galuppo
-
Imperative and simple version for Collatz Conjecture or 3n + 1 Problem
Imperative and simple version for Collatz Conjecture or 3n + 1 Problem
1 people like this
Like the snippet!Posted: 8 years ago by Fabio Galuppo
-
An Associative Fold
A prototype of an associative fold operation when the function passed in arguments is a Semigroup(*) Operation. (*) Semigroup from Abstract Algebra.
2 people like this
Like the snippet!Posted: 8 years ago by Fabio Galuppo
-
Magic 8 Ball
Magic 8 Ball in your console/terminal
2 people like this
Like the snippet!Posted: 8 years ago by Fabio Galuppo
-
BST and DF Traversal
Binary Search Tree and Depth-First Traversal (PreOrder, InOrder, PostOrder)
6 people like this
Like the snippet!Posted: 11 years ago by Fabio Galuppo
-
Backtracking search for Constraint Satisfaction Problems
Backtracking search for Constraint Satisfaction Problems (CSP)
4 people like this
Like the snippet!Posted: 10 years ago by Fabio Galuppo
-
Counting 1-bits in a DWORD
Counting 1-bits in a DWORD (int32) using the 'divide and conquer' strategy
2 people like this
Like the snippet!Posted: 9 years ago by Fabio Galuppo
-
Soundex phonetic algorithm
Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English implemented in F#. https://en.wikipedia.org/wiki/Soundex
5 people like this
Like the snippet!Posted: 8 years ago by Fabio Galuppo
-
Functional and simple version for Collatz Conjecture or 3n + 1 Problem
Functional and simple version for Collatz Conjecture or 3n + 1 Problem
5 people like this
Like the snippet!Posted: 8 years ago by Fabio Galuppo
-
BELLMAN-FORD algorithm
BELLMAN-FORD algorithm to the shortest path based on pseudo code in Algortihms Unlocked
4 people like this
Like the snippet!Posted: 8 years ago by Fabio Galuppo
-
Message Passing: Ping Pong
Message Passing sample inspired by Erlang Ping Pong from here: http://erlang.org/doc/getting_started/conc_prog.html
3 people like this
Like the snippet!Posted: 8 years ago by Fabio Galuppo