vault backup: 2023-10-06 14:36:59

Algo/Courses/Chapter 6 - Lists (Exercises).md

@@ -92,6 +92,11 @@ val search 'a -> 'a list -> bool = <fun>
         else if hd < min2 && hd > min1 then find_second_smallest (hd :: min1 :: tl)
         else find_second_smallest (min2 :: tl)
     in
-    find_second_smallest tl
+    find_second_smallest tl;;
 ```
 
+## Exercise 2.1
+```Ocaml
+let rec arith_list n a r = 
+	
+