Added links for explanation of DFS and Monotonic Array algorithms

Author: SlyyJavii

DFSrecursive.java

@@ -1,3 +1,11 @@
+/*
+ * This is a recursive implementation of the Depth-First Search (DFS) algorithm.
+ * DFS explores as far as possible along each branch before backtracking.
+ * 
+ * For more details, refer to: 
+ * https://en.wikipedia.org/wiki/Depth-first_search
+ */
+
 import java.util.Arrays;
 
 public class DFSrecursive {

MonotonicArray.java

@@ -1,3 +1,11 @@
+/*
+ * This function checks if an array is monotonic.
+ * An array is monotonic if it is either entirely non-increasing or non-decreasing.
+ * 
+ * For more details, refer to:
+ * https://leetcode.com/problems/monotonic-array/
+ */
+
 package CIS_Github;
 import java.util.List;
 
@@ -9,7 +17,7 @@
 Example: [4,2,8,7] (Neither always increasing nor decreasing) {False}
 */
 
-public class Mono {
+public class MonotonicArray {
     //Function to test if list is monotonic
     public static boolean isMonotonic(List<Integer> nums) {
         //Checks that list is always increasing