c++ EDIT ALGORITHM

#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <stdio.h>//C language header file
using namespace std;
 
string input1, input2;
long dist[10000][10000];
 
long levenshtein(string& input1, string& input2){
    for(long i=1; i<=input1.length();i++)
        dist[i][0] = i;
    for(long j=1; j<=input2.length();j++)
        dist[0][j] = j;
 
    for(long j=1; j<=input2.length();j++){
        for(long i=1; i<=input1.length();i++){
            if(input1[i-1]==input2[j-1])dist[i][j]=dist[i-1][j-1];
            else dist[i][j] = min(dist[i-1][j-1]+1,min(dist[i][j-1]+1,dist[i-1][j]+1));
        }
    }
    for(long j=0;j<=input2.length();j++){
        for(long i=0;i<=input1.length();i++)
            printf("%d\t",dist[i][j]);
            printf("\n");
    }
    return dist[input1.length()][input2.length()];
}
int main()
{
    cin>>input1>>input2;
    cout<<"Edit Distance"<<levenshtein(input1,input2)<<endl;
}