aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAryadev Chavali <aryadev@aryadevchavali.com>2023-06-25 07:42:40 +0100
committerAryadev Chavali <aryadev@aryadevchavali.com>2023-06-25 07:42:40 +0100
commit7df5a3c947c2ae9d8ae069a4442ecb8a39c15728 (patch)
tree581e81c091ff1a3c8c67f21b0a7350f82e2af1b9
parentdc090ace5f0f1f07dbd6be6b7aa7b7e35a7a7f9a (diff)
downloadalgorithms-7df5a3c947c2ae9d8ae069a4442ecb8a39c15728.tar.gz
algorithms-7df5a3c947c2ae9d8ae069a4442ecb8a39c15728.tar.bz2
algorithms-7df5a3c947c2ae9d8ae069a4442ecb8a39c15728.zip
(powerset)+lisp program for finding power sets
Working on it right now, just a copyright and documentation so far.
-rw-r--r--powerset.lisp25
1 files changed, 25 insertions, 0 deletions
diff --git a/powerset.lisp b/powerset.lisp
new file mode 100644
index 0000000..2a17a07
--- /dev/null
+++ b/powerset.lisp
@@ -0,0 +1,25 @@
+;;; powerset.lisp --- A program to find the power set of some set
+
+;; Copyright (C) 2021 Aryadev Chavali
+
+;; Author: Aryadev Chavali <aryadev@aryadevchavali.com>
+
+;; This program is free software; you can redistribute it and/or modify
+;; it under the terms of the GNU General Public License as published by
+;; the Free Software Foundation, either version 3 of the License, or
+;; (at your option) any later version.
+
+;; This program is distributed in the hope that it will be useful,
+;; but WITHOUT ANY WARRANTY; without even the implied warranty of
+;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+;; GNU General Public License for more details.
+
+;; You should have received a copy of the GNU General Public License
+;; along with this program. If not, see <https://www.gnu.org/licenses/>.
+
+;;; Commentary:
+;; This program provides a naive counting based approach to finding
+;; specifically sized subsets of some set then using that to generate
+;; the power set. We start by looking for subsets of size n.
+
+;;; Code: