Jan 8, 2011 · How would you go about testing all possible combinations of additions from a given set N of numbers so they add up to a given final number? A brief example: Set of numbers to …

Feb 22, 2010 · A common algorithm with O (log n) time complexity is Binary Search whose recursive relation is T (n/2) + O (1) i.e. at every subsequent level of the tree you divide …

Aug 26, 2008 · How do I calculate the distance between two points specified by latitude and longitude? For clarification, I'd like the distance in kilometers; the points use the WGS84 …

Here is a page that includes a bit of documentation, full source code, and examples of a diff algorithm using the techniques in the aforementioned algorithm. The source code appears to …

Robust peak detection algorithm (using z-scores) I came up with an algorithm that works very well for these types of datasets. It is based on the principle of dispersion: if a new datapoint is a …

Each algorithm is best suited for certain types of image transformations and you can take advantage of that. At the top, the fastest algorithms; at the bottom the slowest (though more …

At each iteration the algorithm chooses a node to expand from the open set (the one with the lowest f function - the f function is the sum of the cost the algorithm already knows it takes to …

What you're looking for are called String Metric algorithms. There a significant number of them, many with similar characteristics. Among the more popular: Levenshtein Distance : The …

Oct 23, 2012 · A* is just like Dijkstra, the only difference is that A* tries to look for a better path by using a heuristic function which gives priority to nodes that are supposed to be better than …

May 18, 2009 · In CS, the algorithm is the steps and the method is the means by which we do an action. All the math formulas would be algorithms as they give us instructions how to find or do …