Differences

This shows you the differences between two versions of the page.

--- courses:cs211:winter2012:journals:jeanpaul:chaptter2section4 [2012/01/24 23:08] – mugabej
+++ courses:cs211:winter2012:journals:jeanpaul:chaptter2section4 [2012/01/24 23:11] (current) – mugabej
@@ Line 65: / Line 65: @@
 algorithm:\\
-for each set S<sub>i</sub>  \\
+ for each set S<sub>i</sub>  \\
     for each other set S<sub>j</sub> \\
        for each element //p// of S<sub>i</sub>  \\
@@ Line 74: / Line 74: @@
        Endif  \\
      Endfor \\
- Endfor  \\
+  Endfor  \\
 =====O(n^k) Time=====
@@ Line 83: / Line 83: @@
 Algorithm: \\
-for each subset S of k nodes \\
+  for each subset S of k nodes \\
-    check whether S constitutes an Independent set \\
+      check whether S constitutes an Independent set \\
-    if S is an Independent set then \\
+      if S is an Independent set then \\
-       Stop and declare success \\
+         Stop and declare success \\
-    Endif \\
+      Endif \\
-Endfor \\
+  Endfor \\
-if no k-node independent set was found then  \\
+  if no k-node independent set was found then  \\
-   Declare failure \\
+     Declare failure \\
-Endif \\
+  Endif \\
@@ Line 99: / Line 99: @@
 Algorithm: \\
-for each subset S of nodes \\
+  for each subset S of nodes \\
-    check whether S constitutes and independent set \\
+     check whether S constitutes and independent set \\
-    If S is a larger independent set than the largest seen so far, then \\
+     If S is a larger independent set than the largest seen so far, then \\
          Record the size of S as the current maximum \\
-    Endif \\
+     Endif \\
-Endfor \\
+  Endfor \\
 The running time of this brute-force algorithm is O(n²2<sup>n</sup>).\\