HOMESEARCH

Looking for something in particular? the entire directory   only this category More search options
 
Home : Math : Higher Mathematics : Discrete Mathematics : Rosen, Discrete Mathematics and Its Applications, 6th Edition : Chapter 04 : Page 2
LINKS:
  Pages: [<<] 1 2
  • Page 311 - Section 4.4
    Recursive Procedures -- A brief introduction to recursive procedures can be found here.
    http://unics.rrzn.uni-hannover.de/zzzzwg1/HPF-Kurs/HTMLHPFCourseNotesnode131.html
    (Added: Fri Jul 28 2006)
  • Page 311 - Section 4.4
    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 315 - Section 4.4
    Prove Correctness -- A proof using mathematical induction that the insertion sort is correct can be found here.
    http://www.cs.duke.edu/education/courses/cps130/fall98/lectures/lect05/node16.html
    (Added: Fri Jul 28 2006)
  • Page 317 - Section 4.4
    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 317 - Section 4.4
    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 317 - Section 4.4
    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 317 - Section 4.4
    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 322 - Section 4.4 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 322 - Section 4.4 Exercises
    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 322 - Section 4.4 Exercises
    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 322 - Section 4.4 Exercises
    Proofs of Correctness -- The correctness of the quicksort is proved using strong induction here.
    http://www.cc.gatech.edu/people/home/idris/AlgorithmsProject/ProofMethods/Induction/ProofOfCorrectness.html
    (Added: Fri Jul 28 2006)
  • Page 323 - Section 4.5
    Hoare logic -- To learn more about Hoare triples, go to this Wikipedia article on Hoare logic.
    http://en.wikipedia.org/wiki/Hoare_logic
    (Added: Fri Jul 28 2006)
  • Page 324 - Section 4.5
    Tony Hoare -- You can find the home page of C.A.R.(Tony) Hoare, including a brief biography and information about his work and research interests here.
    http://www.comlab.ox.ac.uk/oucl/people/tony.hoare.html
    (Added: Fri Jul 28 2006)
  • Page 326 - Section 4.5
    CSCI 256: Program Verification -- You can see a proof of correctness involving loop invariants here.
    http://www.cs.williams.edu/~kim/cs256/verif.html
    (Added: Fri Jul 28 2006)
  • Page 332 - Supplementary Exercises
    John McCarthy's home page -- For more information about John McCarthy look here.
    http://www-formal.stanford.edu/jmc/
    (Added: Fri Jul 28 2006)
  • Page 332 - Supplementary Exercises
    John McCarthy's Biography –- Biographical information about John McCarthy can be found on Wikipedia.
    http://en.wikipedia.org/wiki/John_McCarthy_(computer_scientist)
    (Added: Fri Jul 28 2006)
  Pages: [<<] 1 2
 
HOMESEARCH

Copyright ©2001 The McGraw-Hill Companies.
Any use is subject to the Terms of Use and Privacy Policy.
McGraw-Hill Higher Education is one of the many fine businesses of the The McGraw-Hill Companies.