Computes Fibonacci Numbers using Dynamic Programming Algorithm (Memoization) on MATLAB.

Fibonacci_Algorithm.m

% This technique is mainly used to optimize the running time of the algorithm, it transfoms exponential time caused by the recursion
% into polynomial time.
% Run this file on Matlab (with the csv files in the same dir) 
clear
clc
n=input("N= ");
memo=dlmread('data.csv');    %Read memoized values array
memo_index=dlmread('index.csv');    %Read indexes of the memoized values
fib(1)=1;
fib(2)=1;
if n<=2
    fib(n)
else
    if ismember(n, memo_index) == 1
       memo(n)
       disp('Computed using Dynamic Programming!');
    else
        for i=3:1:n
            fib(i)=fib(i-1)+fib(i-2);
            memo(i)=fib(i);
            memo_index(i)=i;
        end
    memo(n)
    end
end
dlmwrite('data.csv',memo);   %Update the file containing the array by adding the new computed values
dlmwrite('index.csv',memo_index);   %Update the indexes

Before running, make sure to create two blank (csv) files with this names: "data.csv" and "index.csv" in the same directory as the code.