Difference between revisions of "Template:Introduction to Algorithms/testcases"
imported>David Eppstein (another one) |
imported>Trappist the monk |
||
| Line 16: | Line 16: | ||
{{Test case|_collapsible=yes|_showcode=yes|_title=No title link | {{Test case|_collapsible=yes|_showcode=yes|_title=No title link | ||
| − | | | + | |title-link=unset}} |
<!-- | <!-- | ||
Revision as of 12:10, 9 January 2018
| This is the template test cases page for the sandbox of Template:Introduction to Algorithms. Script error: No such module "Purge". to update the examples. If there are many examples of a complicated template, later ones may break due to limits in MediaWiki, see the HTML comment "NewPP limit report" in the rendered page. You can also use Special:ExpandTemplates to examine the results of template uses. You can test how this page looks in the different skins with these links: |
| 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|edition=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. Introduction to Algorithms (1 ed.). MIT Press and McGraw-Hill. |
| 2nd Ed. |
|---|
{{Introduction to Algorithms|edition=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. Introduction to Algorithms (2 ed.). MIT Press and McGraw-Hill. |
| 3rd Ed. |
|---|
{{Introduction to Algorithms|edition=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. Introduction to Algorithms (3 ed.). MIT Press and McGraw-Hill. |
| Chapter, pages, and mode cs2 |
|---|
{{Introduction to Algorithms|chapter=Section 2.1: Insertion sort|edition=2|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., "Section 2.1: Insertion sort", Introduction to Algorithms (2 ed.), MIT Press and McGraw-Hill, pp. 15–21 |
| 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. |