# Recursive fibonacci c source code

The following C project contains the C source code and C examples used for recursive fibonacci. A complete system to find the n th order value in a Fibonacci series

The following java project contains the java source code and java examples used for spell checker using the levenshtein distance. DESCRIPTION: This code uses the Levenshtein distance algorithm to compare a misspelled word to multiple words in a dictionary.

The following java project contains the java source code and java examples used for the 0/1 knapsack problem. This program implements 0/1 Knapsack problem by dynamic programming.

The following java project contains the java source code and java examples used for knapsack problem. This program performs algorithm for knapsack problem by Greedy programming technique.

The following java project contains the java source code and java examples used for all pairs shortest path. This program implements All Pairs Shortest Path algorithm by dynamic programming.

The following Matlab project contains the source code and Matlab examples used for continuous dynamic time warping.
If you pass in 2 vectors it returns the unnormalized distance between the vectors, the accumulated distance between them, the length of the warping path (the normalizing factor), the warping path points and both warped input vectors.

The following Matlab project contains the source code and Matlab examples used for vectorized floyd warshall.
The Floyd-Warshall algorithm computes the all pairs shortest path matrix for a given adjacency matrix.

The following Matlab project contains the source code and Matlab examples used for longest common subsequence.
%%%INPUT
%%%X, Y - both are strings e.g. 'test' or 'stingtocompare'
%%%OUTPUT
%%%D is the substring over the length of the shortest string
%%%dist is the length of the substring
%%%aLongestString is a sting of length dist (only one of potentially many)

The following Matlab project contains the source code and Matlab examples used for knapsack problem.
The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the count of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible.

The following Matlab project contains the source code and Matlab examples used for find nearest matching string from a set.
Uses a modified Vagner-Fischer algorithm to find the Levenshtein distance between each pair of strings.

The following Matlab project contains the source code and Matlab examples used for dynamic time warping (dtw).
DTW is implemented in both Matlab and C/MEX. The C/MEX function is very fast. The algorithm we use is the standard one from wiki: http://en.wikipedia.org/wiki/Dynamic_time_warping
There is a demo in the package. To use, just call:
d=dtw(s,t,w) or d=dtw_c(s,t,w)

The following Matlab project contains the source code and Matlab examples used for viterbi algorithm (belief propagation) for hmm map inference.
Viterbi algorithm based on the Python code found at: http://en.

The following Matlab project contains the source code and Matlab examples used for the bellman ford moore shortest path algorithm.
Over the years I have looked at many Shortest Path FEX submissions.

The following Matlab project contains the source code and Matlab examples used for most probable path using viterbi algorithm.
The submission considers a case where you deduce what weather it is given the status of a shirt that is hung outside.

The following Matlab project contains the source code and Matlab examples used for markov decision processes (mdp) toolbox.
The MDP toolbox proposes functions related to the resolution of discrete-time Markov Decision Processes: backwards induction, value iteration, policy iteration, linear programming algorithms with some variants.

The following Matlab project contains the source code and Matlab examples used for dynamic time warping.
If you pass in 2 vectors it returns the unnormalized distance between the vectors, the accumulated distance between them, the length of the warping path (the normalizing factor), and the warping path points.

The following Matlab project contains the source code and Matlab examples used for forward viterbi algorithm.
Forward Viterbi algorithm based on the Python code found at: http://en.

The following Matlab project contains the source code and Matlab examples used for solves the 0-1 knapsack problem using preprocessing and dynamic programming. .
[FMAX,X] = KP01(W,P,C) solves the combinatorial optimization problem
maximize F = SUM(P.

The following Matlab project contains the source code and Matlab examples used for solves the 0-1 knapsack problem with positive integer weights. .
Uses dynamic programming to solve the problem, see for example http://en.wikipedia.org/wiki/Knapsack_problem .

The following Matlab project contains the source code and Matlab examples used for knapsack problem.
Two things to calculate
1. optimized value
2.elements taken

The following Matlab project contains the source code and Matlab examples used for dynamic programming .
Dynamic programming results in the creation of a optimal path like A star.

The following Matlab project contains the source code and Matlab examples used for correlation based dynamic time warping of multivariate time series.
A novel algorithm called correlation based dynamic time warping (CBDTW) wich combines DTW and PCA based similarity measures.

The following Visual Basic project contains the source code and Visual Basic examples used for hamming & levenshtein distance; text subclassing example. This is a simple application that calculates Hamming distance, Hamming weight, Levenshtein distance and Logarithm in three different bases.

The following Visual Basic project contains the source code and Visual Basic examples used for get the substring of a string between two given substrings. This function returns the substring found between to given strings.

The following package and source code is about Longest Increasing Subsequence Independence Test for continuous random variables.