vault backup: 2023-10-27 15:18:50

Algo/Courses/Chapter 7 - High Order (exercises).md

@@ -78,4 +78,12 @@ val partition : ('a -> bool) -> 'a list -> 'a list * 'a list = <fun>
 ```
 
 ## Ex 2.7
-```Ocaml
+```
+# let less2 p k l1 l2 =
+	if k < 0 then invalid_arg "k needs to be positive" else
+		let rec less p k l1 l2 acc = match (l1, l2) with 
+			| ([],[]) -> acc < k
+			| (e::t, e::t2) -> if p e e2 then less p k t t2 (acc + 1)
+				else less p k t t2 acc
+		in less p k l1 l2 0;;
+val less2 : ('a -> 'b →> bool) > int →> 'a list -> 'b list > bool = <fun>