Algorithms


 * itoa
 * http://projecteuler.net/
 * http://alloy.mit.edu/community/models
 * http://embeddedgurus.com/stack-overflow/category/algorithms/

/** * @author Luther Baker */ public class NodeCheck {   public static class Node {       Node left; Node right; int val; }

public boolean check(final Node a, final Node b)   { if (a == null && b == null) { return true; }

if (a != null && b != null) { final boolean same = check(a.left, b.left); if (same) { return check(a.right, b.right); }       }

return false; } }

Bloom Filters
"An empty Bloom filter is a bit array of m bits, all set to 0. There must also be k different hash functions defined, each of which maps or hashes some set element to one of the m array positions with a uniform random distribution. To add an element, feed it to each of the k hash functions to get k array positions. Set the bits at all these positions to 1. To query for an element (test whether it is in the set), feed it to each of the k hash functions to get k array positions. If any of the bits at these positions are 0, the element is not in the set – if it were, then all the bits would have been set to 1 when it was inserted. If all are 1, then either the element is in the set, or the bits have been set to 1 during the insertion of other elements."
 * http://jaspell.sourceforge.net/javadocs/pt/tumba/spell/BloomFilter.html
 * http://pages.cs.wisc.edu/~cao/papers/summary-cache/node8.html
 * http://www.codecommit.com/blog/scala/bloom-filters-in-scala
 * http://en.wikipedia.org/wiki/Bloom_filter