updated the code so that it would run even with extremely large N (number of...

updated the code so that it would run even with extremely large N (number of closest words), such as 5000

distance.c

@@ -24,7 +24,7 @@ const long long max_w = 50;              // max length of vocabulary entries
 int main(int argc, char **argv) {
   FILE *f;
   char st1[max_size];
-  char bestw[N][max_size];
+  char *bestw[N];
   char file_name[max_size], st[100][max_size];
   float dist, len, bestd[N], vec[max_size];
   long long words, size, a, b, c, d, cn, bi[100];
@@ -44,6 +44,7 @@ int main(int argc, char **argv) {
   fscanf(f, "%lld", &words);
   fscanf(f, "%lld", &size);
   vocab = (char *)malloc((long long)words * max_w * sizeof(char));
+  for (a = 0; a < N; a++) bestw[a] = (char *)malloc(max_size * sizeof(char));
   M = (float *)malloc((long long)words * (long long)size * sizeof(float));
   if (M == NULL) {
     printf("Cannot allocate memory: %lld MB    %lld  %lld\n", (long long)words * size * sizeof(float) / 1048576, words, size);