https://algorist.com/algowiki_v2/index.php?action=history&feed=atom&title=TADM2E_1.6
TADM2E 1.6 - Revision history
2026-05-01T03:54:06Z
Revision history for this page on the wiki
MediaWiki 1.28.0
https://algorist.com/algowiki_v2/index.php?title=TADM2E_1.6&diff=691&oldid=prev
ZhaoSteven at 22:54, 18 June 2019
2019-06-18T22:54:41Z
<p></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<col class='diff-marker' />
<col class='diff-content' />
<col class='diff-marker' />
<col class='diff-content' />
<tr style='vertical-align: top;' lang='en'>
<td colspan='2' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='2' style="background-color: white; color:black; text-align: center;">Revision as of 22:54, 18 June 2019</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l1" >Line 1:</td>
<td colspan="2" class="diff-lineno">Line 1:</td></tr>
<tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>Let <math>U=\{1,2,3,4,5\}</math> and S consists of <math>S_1=\{1,2,3,4\}</math>, <math>S_2=\{1,2,5\}</math>, <math>S_3=\{3,4,6\}</math>. The algorithm would give an answer of <math>S_1</math>, <math>S_2</math>, <math>S_3</math> but the correct answer is <math>S_2</math>,<math>S_3</math> because it has the fewest subsets and covers <math>U</math>.</div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>Let <math>U=\{1,2,3,4,5<ins class="diffchange diffchange-inline">,6</ins>\}</math> and S consists of <math>S_1=\{1,2,3,4\}</math>, <math>S_2=\{1,2,5\}</math>, <math>S_3=\{3,4,6\}</math>. The algorithm would give an answer of <math>S_1</math>, <math>S_2</math>, <math>S_3</math> but the correct answer is <math>S_2</math>,<math>S_3</math> because it has the fewest subsets and covers <math>U</math>.</div></td></tr>
</table>
ZhaoSteven
https://algorist.com/algowiki_v2/index.php?title=TADM2E_1.6&diff=690&oldid=prev
ZhaoSteven: Fixed.
2019-06-18T22:54:18Z
<p>Fixed.</p>
<table class="diff diff-contentalign-left" data-mw="interface">
<col class='diff-marker' />
<col class='diff-content' />
<col class='diff-marker' />
<col class='diff-content' />
<tr style='vertical-align: top;' lang='en'>
<td colspan='2' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='2' style="background-color: white; color:black; text-align: center;">Revision as of 22:54, 18 June 2019</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l1" >Line 1:</td>
<td colspan="2" class="diff-lineno">Line 1:</td></tr>
<tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>Let <math>U=\{1,2,3\}</math> and S consists of <math>S_1=\{1,2,<del class="diffchange diffchange-inline">8</del>,4<del class="diffchange diffchange-inline">,10</del>\}</math>, <math>S_2=\{1,<del class="diffchange diffchange-inline">3,6</del>,<del class="diffchange diffchange-inline">9</del>\}</math>, <math>S_3=\{<del class="diffchange diffchange-inline">1</del>,<del class="diffchange diffchange-inline">2</del>,<del class="diffchange diffchange-inline">3</del>\}</math>. The algorithm would give an answer of <math>S_1</math>, <math>S_2</math> <del class="diffchange diffchange-inline">but the correct answer is </del><math>S_3</math> <del class="diffchange diffchange-inline">because it has </del>the <del class="diffchange diffchange-inline">fewest elements and covers </del><math><del class="diffchange diffchange-inline">U</del></math><del class="diffchange diffchange-inline">.</del></div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>Let <math>U=\{1,2,3<ins class="diffchange diffchange-inline">,4,5</ins>\}</math> and S consists of <math>S_1=\{1,2,<ins class="diffchange diffchange-inline">3</ins>,4\}</math>, <math>S_2=\{1,<ins class="diffchange diffchange-inline">2</ins>,<ins class="diffchange diffchange-inline">5</ins>\}</math>, <math>S_3=\{<ins class="diffchange diffchange-inline">3</ins>,<ins class="diffchange diffchange-inline">4</ins>,<ins class="diffchange diffchange-inline">6</ins>\}</math>. The algorithm would give an answer of <math>S_1</math>, <math>S_2</math><ins class="diffchange diffchange-inline">, </ins><math>S_3</math> <ins class="diffchange diffchange-inline">but </ins>the <ins class="diffchange diffchange-inline">correct answer is </ins><math><ins class="diffchange diffchange-inline">S_2</ins></math>,<math><ins class="diffchange diffchange-inline">S_3</ins></math> because it <ins class="diffchange diffchange-inline">has </ins>the <ins class="diffchange diffchange-inline">fewest subsets </ins>and <ins class="diffchange diffchange-inline">covers </ins><math>U</math>.</div></td></tr>
<tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div> </div></td><td colspan="2"> </td></tr>
<tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del class="diffchange diffchange-inline">The algorithm would remove elements <math>\{1</del>,<del class="diffchange diffchange-inline">2\}</del><<del class="diffchange diffchange-inline">/</del>math> <del class="diffchange diffchange-inline">(members of <math>S_1</math> is the largest subset in <math>S</math>. Then chose <math>S_2</del></math> because it <del class="diffchange diffchange-inline">is </del>the <del class="diffchange diffchange-inline">next largest </del>and <del class="diffchange diffchange-inline">remove element <math>\{3\}</math>. The algorithm would exit because </del><math>U</math> <del class="diffchange diffchange-inline">is empty. However, <math>S_3</math> is the correct answer</del>.</div></td><td colspan="2"> </td></tr>
</table>
ZhaoSteven
https://algorist.com/algowiki_v2/index.php?title=TADM2E_1.6&diff=689&oldid=prev
Kev at 22:41, 27 May 2019
2019-05-27T22:41:48Z
<p></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<col class='diff-marker' />
<col class='diff-content' />
<col class='diff-marker' />
<col class='diff-content' />
<tr style='vertical-align: top;' lang='en'>
<td colspan='2' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='2' style="background-color: white; color:black; text-align: center;">Revision as of 22:41, 27 May 2019</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l1" >Line 1:</td>
<td colspan="2" class="diff-lineno">Line 1:</td></tr>
<tr><td colspan="2"> </td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">Let <math>U=\{1,2,3\}</math> and S consists of <math>S_1=\{1,2,8,4,10\}</math>, <math>S_2=\{1,3,6,9\}</math>, <math>S_3=\{1,2,3\}</math>. The algorithm would give an answer of <math>S_1</math>, <math>S_2</math> but the correct answer is <math>S_3</math> because it has the fewest elements and covers <math>U</math>.</ins></div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr>
<tr><td colspan="2"> </td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">The algorithm would remove elements <math>\{1,2\}</math> (members of <math>S_1</math> is the largest subset in <math>S</math>. Then chose <math>S_2</math> because it is the next largest and remove element <math>\{3\}</math>. The algorithm would exit because <math>U</math> is empty. However, <math>S_3</math> is the correct answer.</ins></div></td></tr>
</table>
Kev
https://algorist.com/algowiki_v2/index.php?title=TADM2E_1.6&diff=650&oldid=prev
Trampin' all the way: Blanked the page
2019-04-15T07:38:47Z
<p>Blanked the page</p>
<table class="diff diff-contentalign-left" data-mw="interface">
<col class='diff-marker' />
<col class='diff-content' />
<col class='diff-marker' />
<col class='diff-content' />
<tr style='vertical-align: top;' lang='en'>
<td colspan='2' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='2' style="background-color: white; color:black; text-align: center;">Revision as of 07:38, 15 April 2019</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l1" >Line 1:</td>
<td colspan="2" class="diff-lineno">Line 1:</td></tr>
<tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del class="diffchange diffchange-inline">#REDIRECT [[TADM2E 179900.0]]</del></div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div> </div></td></tr>
</table>
Trampin' all the way
https://algorist.com/algowiki_v2/index.php?title=TADM2E_1.6&diff=647&oldid=prev
Trampin' all the way: Trampin' all the way moved page TADM2E 1.6 to TADM2E 179900.0
2019-04-15T07:38:05Z
<p>Trampin' all the way moved page <a href="/algowiki_v2/index.php/TADM2E_1.6" title="TADM2E 1.6">TADM2E 1.6</a> to <a href="/algowiki_v2/index.php/TADM2E_179900.0" class="mw-redirect" title="TADM2E 179900.0">TADM2E 179900.0</a></p>
<p><b>New page</b></p><div>#REDIRECT [[TADM2E 179900.0]]</div>
Trampin' all the way