From: Ramakrishnan Muthukrishnan <vu3rdd@gmail.com>
Date: Tue, 7 Sep 2010 10:55:50 +0000 (+0530)
Subject: solution to 2.60
X-Git-Url: https://git.rkrishnan.org/%5B/frontends/flags/%22doc.html/-?a=commitdiff_plain;h=1578be2aa014727dd0184e859e2ef1eb4234019a;p=sicp.git

solution to 2.60
---

diff --git a/src/sicp/ex2_60.clj b/src/sicp/ex2_60.clj
new file mode 100644
index 0000000..9c2e249
--- /dev/null
+++ b/src/sicp/ex2_60.clj
@@ -0,0 +1,13 @@
+(ns sicp.ex2_60)
+
+;;; a set for which duplicates are allowed
+
+(comment
+  "element-of-set? will be same program and union, intersection and
+   adjoin-set will differ. element-of-set? has to traverse a bigger
+   list in the worst case of element not in the set. But union is easy,
+   just concat the two sets. adjoin-set also does not require traversing
+   the set thru element-of-set?. Instead it is a simple cons of the new
+   element with the list representing the set."
+  "If the application involves"
+  )
\ No newline at end of file