List of Algorithms. A complete list of all major algorithms (300), in any domain.
Regular expressions can be scary...really scary.
This one accepts a single string parameter and returns a boolean indicating whether or not a match has been found. Example. Introduction to Algorithms. Since 2008, Academic Earth has worked diligently to compile an ever-growing collection of online college courses, made available free of charge, from some of the most respected universities.
We proudly build on the precedent set forth by MIT OpenCourseware, believing that everyone deserves access to a world-class education. To facilitate this goal, we have curated links to over 750 online courses and 8,500 individual online lectures, giving students of all ages unparalleled access to college courses they may otherwise never experience. Whether supplementing existing coursework, or learning for the sake of learning, anyone with an internet connection has the freedom to learn at their own pace from world-renowned experts, without the burden of rising tuition costs. To access this collection of free online college courses, simply select your area of interest from the menu below.
From Art and Design to Social Science, Academic Earth is sure to have the course you’re looking for. Computer Programming Algorithms Directory.
Damn Cool Algorithms: Levenshtein Automata. Posted by Nick Johnson | Filed under python, coding, tech, damn-cool-algorithms In a previous Damn Cool Algorithms post, I talked about BK-trees, a clever indexing structure that makes it possible to search for fuzzy matches on a text string based on Levenshtein distance - or any other metric that obeys the triangle inequality. Today, I'm going to describe an alternative approach, which makes it possible to do fuzzy text search in a regular index: Levenshtein automata. Introduction The basic insight behind Levenshtein automata is that it's possible to construct a Finite state automaton that recognizes exactly the set of strings within a given Levenshtein distance of a target word. We can then feed in any word, and the automaton will accept or reject it based on whether the Levenshtein distance to the target word is at most the distance specified when we constructed the automaton.
Of course, if that were the only benefit of Levenshtein automata, this would be a short article. Indexing.