🎉

Author: pl3onasm

Extra-C/prob03/prob3-2.c

@@ -4,7 +4,9 @@
   description: extra, problem 3, maximum path
   version: 3.2, using functions library and
     while the time complexity is still in O(n²), the
-    space complexity is now in O(n) instead of O(n²)
+    space complexity is now in O(n) instead of O(n²),
+    by using only two rows of size n instead of a
+    2D array of size n²
 */
 
 #include <stdio.h>

Extra-C/prob05/prob5-2.c

@@ -1,7 +1,7 @@
 /* file: prob5-2.c
    author: David De Potter
    description: extra, problem 5, next smaller number
-   version: 5.2, using the functions library
+   version: 5.2, using the clib library
 */
 
 #include <stdio.h>

Extra-C/prob06/prob6-2.c

@@ -2,7 +2,7 @@
   file: prob6-2.c
   author: David De Potter
   description: extra, problem 6, balanced brackets
-  version: 6.2, using the functions library
+  version: 6.2, using the clib library
 */
 
 #include <stdio.h>

Extra-C/prob07/prob7-2.c

@@ -2,7 +2,7 @@
   file: prob7-2.c
   author: David De Potter
   description: extra, problem 7, matching bitstrings
-  version: 7.2, using the functions library
+  version: 7.2, using the clib library
 */
 
 #include <stdio.h>

Extra-C/prob08/prob8-2.c

@@ -2,7 +2,7 @@
   file: prob8-2.c
   author: David De Potter
   description: extra, problem 8, segments
-  version: 8.2, using the functions library and qsort
+  version: 8.2, using the clib library and qsort
 */
 
 #include <stdio.h>

Functions/clib/clib.h

@@ -3,8 +3,8 @@
    description: header file for the clib library
 */
 
-#ifndef FUNCTIONS_H_INCLUDED    
-#define FUNCTIONS_H_INCLUDED
+#ifndef CLIB_H_INCLUDED    
+#define CLIB_H_INCLUDED
 
 //::::::::::::::::::::::::: MACROS :::::::::::::::::::::::::::::://
 
@@ -245,4 +245,4 @@ void quickSort(int *array, int size);
   // assumes the range between min and max value is not too large
 void countingSort(int *array, int size);
 
-#endif // FUNCTIONS_H_INCLUDED
+#endif // CLIB_H_INCLUDED