 | | Home : Math : Higher Mathematics : Discrete Mathematics : Rosen, Discrete Mathematics and Its Applications, 6th Edition : Chapter 03 | | LINKS: |  | |
Pages: 1 2 3 4 [>>] | - Page 168 - Section 3.1
Abu Ja'far Muhammed ibn Musa Al'Khwarizmi -- Biographical information and a portrait al-Khowarizmi (note that there are many variations on his name), as well as facsimiles of some pages of his work, can be seen at the MacTutor History of Mathematics Archive site at the University of St. Andrews, Scotland.
http://www-groups.dcs.st-and.ac.uk/~history/Mathematicians/Al-Khwarizmi.html
(Added: Fri Jul 28 2006)
- Page 170 - Section 3.1
Sorting and Searching Algorithms: A Cookbook -- You can find information about sorting algorithms in this online guide written by Thomas Niemann (requires a PDF viewer).
http://www.cs.auckland.ac.nz/software/AlgAnim/niemann/s_man.pdf
(Added: Fri Jul 28 2006)
- Page 171 - Section 3.1
Binary Search Algorithm Applet -- The steps used by the binary search algorithm to search for an element you specify are displayed by the applet here. You can either have a sequence randomly generated or enter your own sequence.
http://desdemona.la.asu.edu/~mat243/applets/BS/BSApplet.php
(Added: Fri Jul 28 2006)
- Page 171 - Section 3.1
Binary Search Applet -- You can find an applet illustrating binary search here.
http://math.la.asu.edu/~andrzej/java/BS-applet.html
(Added: Fri Jul 28 2006)
- Page 173 - Section 3.1
Sorting and Searching Algorithms: A Cookbook -- You can find information about sorting algorithms in this online guide written by Thomas Niemann (requires a PDF viewer).
http://www.cs.auckland.ac.nz/software/AlgAnim/niemann/s_man.pdf
(Added: Fri Jul 28 2006)
- Page 173 - Section 3.1
Sorting Algorithms -- You can find visualizations of 24 different comparison-based sorting algorithms along with downloadable source code for most of the algorithms at a website from Carleton University. Go here.
You can compare three different sorting algorithms by running them concurrently using the interactive applets provided.
http://cg.scs.carleton.ca/~morin/misc/sortalg/
(Added: Fri Jul 28 2006)
- Page 173 - Section 3.1
Sorting Algorithms Demo -- You can find Java applets that chart the progress of common sorting algorithms as well as source code for these algorithms here.
http://www.cs.ubc.ca/spider/harrison/Java/sorting-demo.html
(Added: Fri Jul 28 2006)
- Page 173 - Section 3.1
CFXweb -- A useful discussion of sorting algorithms, including extensive examples and code samples, can be found here.
http://www.cfxweb.net/article.php?sid=584
(Added: Fri Jul 28 2006)
- Page 173 - Section 3.1
5.2.1.3 The bubble sort algorithm -- A description and analysis of the bubble sort and insertion sort algorithms can be found by exploring here.
http://www.scism.sbu.ac.uk/law/Section5/chap2/s5c2p13.html
(Added: Fri Jul 28 2006)
- Page 174 - Section 3.1
Sorting Algorithms -- You can find visualizations of 24 different comparison-based sorting algorithms along with downloadable source code for most of the algorithms at a website from Carleton University. You can compare three different sorting algorithms by running them concurrently using the interactive applets provided.
http://cg.scs.carleton.ca/~morin/misc/sortalg/
(Added: Fri Jul 28 2006)
- Page 174 - Section 3.1
Sorting and Searching Algorithms: A Cookbook -- You can find information about sorting algorithms in this online guide written by Thomas Niemann (requires a PDF viewer).
http://www.cs.auckland.ac.nz/software/AlgAnim/niemann/s_man.pdf
(Added: Fri Jul 28 2006)
- Page 174 - Section 3.1
Insertion Sort Demo -- Code for the insertion sort along with an example showing each iteration when a particular set of integers is sorted can be found here.
http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Sort/Insertion/
(Added: Fri Jul 28 2006)
- Page 174 - Section 3.1
Insertion Sort Algorithm -- Code for the insertion sort along with an example showing each iteration when a particular set of integers is sorted can be found here.
http://max.cs.kzoo.edu/~abrady/java/sorting/InsertionSort.html
(Added: Fri Jul 28 2006)
- Page 175 - Section 3.1
Greedy Algorithms -- You can learn about greedy algorithms starting here.
http://www.cs.usask.ca/resources/tutorials/csconcepts/2001_5/greedy1.html
(Added: Fri Jul 28 2006)
- Page 176 - Section 3.1
Undecidability of the Halting Problem -- An interesting discussion of the halting problem by Martin Cohn and Harry Mairson of the Computer Science Department at Brandeis University can be found here.
http://www.cs.brandeis.edu/~mairson/poems/node5.html
(Added: Fri Jul 28 2006)
- Page 178 - Section 3.1 Exercises
Sorting Algorithms -- You can find visualizations of 24 different comparison-based sorting algorithms along with downloadable source code for most of the algorithms at a website from Carleton University. You can compare three different sorting algorithms by running them concurrently using the interactive applets provided.
http://cg.scs.carleton.ca/~morin/misc/sortalg/
(Added: Fri Jul 28 2006)
- Page 179 - Section 3.1 Exercises
Stable Marriage Problem -- You can learn more about the stable marriage problem by consulting the Wikipedia article here.
http://en.wikipedia.org/wiki/Stable_marriage_problem
(Added: Fri Jul 28 2006)
- Page 179 - Section 3.1 Exercises
The Stable Marriage Problem -- An applet for the deferred acceptance algorithm developed by David Manlove (also known as the Gale-Shapley algorithm) can be found here.
http://www.dcs.gla.ac.uk/research/algorithms/stable/EGSapplet/intro.html
(Added: Fri Jul 28 2006)
- Page 181 - Section 3.2
Lecture Notes on Algorithm Analysis and Complexity Theory -- Ian Parberry of University of North Texas provides useful useful material on many topics in discrete mathematics with these lecture notes. You will need a PDF viewer to read these notes.
http://www.eng.unt.edu/ian/books/free/lnoa.pdf
(Added: Fri Jul 28 2006)
- Page 182 - Section 3.2
Paul Gustav Heinrich Bachmann -- Biographical information about Paul Bachmann can be found at the MacTutor History of Mathematics Archive at the University of St. Andrews, Scotland.
http://www-groups.dcs.st-andrews.ac.uk/~history/Mathematicians/Bachmann.html
(Added: Fri Jul 28 2006)
- Page 183 - Section 3.2
Edmund Landau -- Biographical information and a portrait of Edmund Landau can be found at the site of the Edmund Landau Center for Research in Mathematical Analysis at the Hebrew University in Israel.
http://www.ma.huji.ac.il/~landau/landau.html
(Added: Fri Jul 28 2006)
- Page 184 - Section 3.2
Donald Knuth's Home Page -- You can find Donald Knuth's home page, containing a wealth of information about his activities, books, and interests here.
http://www-cs-faculty.stanford.edu/~knuth/
(Added: Fri Jul 28 2006)
- Page 184 - Section 3.2
Interview: Donald E. Knuth -- You can read the transcript of an interview with Donald Knuth here.
http://www.advogato.org/article/28.html
(Added: Fri Jul 28 2006)
- Page 184 - Section 3.2
Innovations Interviews: Donald Knuth on The Art of Computer Programming -- An interview with Donald Knuth on his magnum opus The Art of Computer Programming can be found at the following site.
http://www.awprofessional.com/content/images/0201896834/interview/0201896834.html
(Added: Fri Jul 28 2006)
- Page 193 - Section 3.3
Lecture Notes on Algorithm Analysis and Complexity Theory -- Ian Parberry of University of North Texas provides useful useful material on many topics in discrete mathematics with these lecture notes. You will need a PDF viewer to read these notes.
http://www.eng.unt.edu/ian/books/free/lnoa.pdf
(Added: Fri Jul 28 2006)
| |
Pages: 1 2 3 4 [>>] | |
