Add the first post in CS325 series

code/cs325-langs/sols/hw1.lang

@@ -17,4 +17,3 @@ sorted(xs) = sorted(xs[0]) ++ [xs[1]] ++ sorted(xs[2]);
 search(xs, k) = |_search(xs, k)| != 0;
 insert(xs, k) = _insert(k, _search(xs, k));
 _insert(k, xs) = if |xs| == 0 then xs << [] << k << [] else xs
-