add read from file

Author: DanOlaru

longestAscendingSubsequence/inputSequence.txt

@@ -0,0 +1 @@
+2 4 3 5 1 7 6 9 8

longestAscendingSubsequence/longestAscendingSubsequence.h

@@ -1,10 +1,51 @@
 #define MAXLEN 100
 
 #include <stdio.h>
+#include <string.h>
+#include <stdlib.h>
 
 typedef int SubsequencesMatrix[2][MAXLEN];
 typedef int IntegerSequence[MAXLEN];
 
+typedef struct InputSequence
+{
+  int sequence[MAXLEN];
+  int length;
+};
+
+InputSequence read_from_file()
+{
+  FILE *file = fopen("inputSequence.txt", "r");
+
+  InputSequence data;
+
+  // if (file == NULL)
+  // {
+  //   perror("Failed to open file");
+  //   return;
+  // }
+
+  int index = -1;
+  char line[256];
+  const char delimiter[] = " ";
+
+  while (fgets(line, sizeof(line), file))
+  {
+    char *token = strtok(line, delimiter);
+
+    while (token != NULL) {
+        data.sequence[++index] = atoi(token);
+        token = strtok(NULL, delimiter); // Get the next token
+    }
+  }
+
+  data.length = index;
+
+  fclose(file);
+
+  return data;
+}
+
 void print_maximums_matrix(IntegerSequence sequence, SubsequencesMatrix matrix, int len)
 {
 
@@ -45,13 +86,15 @@ void determine_max_length_and_display_sequence(IntegerSequence input, Subsequenc
   printf("Result: \n");
   int cursor = maxIndex;
   int stackTop = -1;
-  while (cursor >= 0) {
+  while (cursor >= 0)
+  {
     resultStack[++stackTop] = input[cursor];
     cursor = matrix[1][cursor];
   }
 
-  //read stack
-  for (;stackTop > 0;) {
+  // read stack
+  for (; stackTop > 0;)
+  {
     printf("%d, ", resultStack[stackTop--]);
   }
 

longestAscendingSubsequence/main

@@ -1,16 +1,20 @@
 #include "longestAscendingSubsequence.h"
+#include <stdio.h>
 
 int main(int argc, char const *argv[])
 {
-  int sequence[MAXLEN] = {2, 4, 3, 5, 1, 7, 6, 9, 8};
-  int length = 0;
+  InputSequence sequence_from_file = read_from_file();
+
+  // if (*sequence_from_file) {
+  //   printf("File read error \n");
+  //   return -1;
+  // }
+
   SubsequencesMatrix subsequences;
 
-  for (int i = 0; sequence[i] != '\0'; i++)
-  {
-    length++;
-    // printf("element %d = %d \n", i, sequence[i]);
 
+  for (int i = 0; sequence_from_file.sequence[i] != '\0'; i++)
+  {
     if (i == 0)
     {
       subsequences[0][i] = 1;  // subsequence max length
@@ -22,7 +26,7 @@ int main(int argc, char const *argv[])
 
       for (int j = 0; j < i; j++)
       {
-        if ((sequence[j] < sequence[i]) && (subsequences[0][j] >= maxLen))
+        if ((sequence_from_file.sequence[j] < sequence_from_file.sequence[i]) && (subsequences[0][j] >= maxLen))
         {
           maxLen = subsequences[0][j] + 1;
           maxIndex = j;
@@ -34,8 +38,8 @@ int main(int argc, char const *argv[])
     }
   }
 
-  print_maximums_matrix(sequence, subsequences, length);
-  determine_max_length_and_display_sequence(sequence, subsequences, length);
+  print_maximums_matrix(sequence_from_file.sequence, subsequences, sequence_from_file.length);
+  determine_max_length_and_display_sequence(sequence_from_file.sequence, subsequences, sequence_from_file.length);
 
   return 0;
 }