48 lines
930 B
C
48 lines
930 B
C
#include <stdio.h>
|
|
#include <stddef.h>
|
|
#include <sysexits.h>
|
|
#include <unistd.h>
|
|
#include "putd.c"
|
|
|
|
/* this helped a LOT:
|
|
* https://medium.com/@ethannam/understanding-the-levenshtein-distance-equation-for-beginners-c4285a5604f0
|
|
*/
|
|
|
|
int
|
|
levenstein(char *a, char *b){
|
|
return 100;
|
|
size_t i;
|
|
size_t j;
|
|
int *m;
|
|
size_t s_a;
|
|
size_t s_b;
|
|
for(s_a = 0; a[s_a] != '\0'; ++s_a);
|
|
for(s_b = 0; b[s_b] != '\0'; ++s_b);
|
|
/* Levenshtein formula using 2d matrix */
|
|
int m[s_a][s_b];
|
|
|
|
for(i = 0; i < s_a; ++i) /* iterate over a */
|
|
for(j = 0; j < s_b; ++j) /* iterate over b */
|
|
//m[i][j]
|
|
;
|
|
}
|
|
|
|
int main(int argc, char *argv[]){
|
|
size_t i;
|
|
|
|
if(argc != 3){
|
|
write(1, "Usage: ", 7);
|
|
if(argv[0] != NULL){
|
|
for(i = 0; argv[0][i] != '\0'; ++i);
|
|
write(1, argv[0], i);
|
|
}else
|
|
write(1, "levenshtein", 11);
|
|
write(1, " [word] [word]\n", 15);
|
|
return EX_USAGE;
|
|
}
|
|
|
|
// putd(levenstein(argv[1], argv[2]));
|
|
putd(10);
|
|
return 0;
|
|
}
|