Difference between revisions of "Template:Introduction to Algorithms/testcases"

From blackwiki
Jump to navigation Jump to search
imported>David Eppstein
(some test cases)
 
imported>Trappist the monk
 
(2 intermediate revisions by 2 users not shown)
Line 1: Line 1:
 
{{Testcases notice <!--|toc=on-->}}
 
{{Testcases notice <!--|toc=on-->}}
  
{{Test case|_collapsible=yes|_showcode=yes|_title=Test1}}
+
{{Test case|_collapsible=yes|_showcode=yes|_title=Defaults}}
  
{{Test case|_collapsible=yes|_showcode=yes|_title=Test2
+
{{Test case|_collapsible=yes|_showcode=yes|_title=1st Ed.
|edition=1}}
+
|1=1}}
  
{{Test case|_collapsible=yes|_showcode=yes|_title=Test3
+
{{Test case|_collapsible=yes|_showcode=yes|_title=2nd Ed.
|edition=2}}
+
|1=2}}
  
{{Test case|_collapsible=yes|_showcode=yes|_title=Test4
+
{{Test case|_collapsible=yes|_showcode=yes|_title=3rd Ed.
|edition=3}}
+
|1=3}}
  
{{Test case|_collapsible=yes|_showcode=yes|_title=Test5
+
{{Test case|_collapsible=yes|_showcode=yes|_title=Chapter, pages, and mode cs2
|edition=2|chapter=Section 2.1: Insertion sort|pages=15–21|mode=cs2}}
+
|1=2|chapter=Section 2.1: Insertion sort|pages=15–21|mode=cs2}}
 +
 
 +
{{Test case|_collapsible=yes|_showcode=yes|_title=No title link
 +
|title-link=unset}}
  
 
<!--
 
<!--

Latest revision as of 16:07, 9 January 2018

Defaults
{{Introduction to Algorithms}}

{{Introduction to Algorithms}}

Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L. Introduction to Algorithms. MIT Press and McGraw-Hill.

{{Introduction to Algorithms/sandbox}}

Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L. Introduction to Algorithms. MIT Press and McGraw-Hill.

1st Ed.
{{Introduction to Algorithms|1}}

{{Introduction to Algorithms}}

Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L. (1990). Introduction to Algorithms (1st ed.). MIT Press and McGraw-Hill. ISBN 0-262-03141-8.

{{Introduction to Algorithms/sandbox}}

Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L. (1990). Introduction to Algorithms (1st ed.). MIT Press and McGraw-Hill. ISBN 0-262-03141-8.

2nd Ed.
{{Introduction to Algorithms|2}}

{{Introduction to Algorithms}}

Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001) [1990]. Introduction to Algorithms (2nd ed.). MIT Press and McGraw-Hill. ISBN 0-262-03293-7.

{{Introduction to Algorithms/sandbox}}

Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001) [1990]. Introduction to Algorithms (2nd ed.). MIT Press and McGraw-Hill. ISBN 0-262-03293-7.

3rd Ed.
{{Introduction to Algorithms|3}}

{{Introduction to Algorithms}}

Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2009) [1990]. Introduction to Algorithms (3rd ed.). MIT Press and McGraw-Hill. ISBN 0-262-03384-4.

{{Introduction to Algorithms/sandbox}}

Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2009) [1990]. Introduction to Algorithms (3rd ed.). MIT Press and McGraw-Hill. ISBN 0-262-03384-4.

Chapter, pages, and mode cs2
{{Introduction to Algorithms|2|chapter=Section 2.1: Insertion sort|mode=cs2|pages=15–21}}

{{Introduction to Algorithms}}

Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001) [1990], "Section 2.1: Insertion sort", Introduction to Algorithms (2nd ed.), MIT Press and McGraw-Hill, pp. 15–21, ISBN 0-262-03293-7

{{Introduction to Algorithms/sandbox}}

Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001) [1990], "Section 2.1: Insertion sort", Introduction to Algorithms (2nd ed.), MIT Press and McGraw-Hill, pp. 15–21, ISBN 0-262-03293-7

No title link
{{Introduction to Algorithms|title-link=unset}}

{{Introduction to Algorithms}}

Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L. Introduction to Algorithms. MIT Press and McGraw-Hill.

{{Introduction to Algorithms/sandbox}}

Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L. Introduction to Algorithms. MIT Press and McGraw-Hill.