You can find biographies of eight members of the Bernoulli family at the MacTutor History of Mathematics Archive, University of St Andrews, Scotland. To find these biographies, look at the index page of names that begin with the letter B.

A detailed description of binary search trees and implementations of binary search tree functions (insert, delete, and find) in both C and Visual Basic can be found at the Sorting and Searching Algorithms: A Cookbook written by Thomas Niemann. The material on binary search trees can be found in the Dictionaries chapter of the site.

The Grey Labyrinth Puzzle site describes a puzzle on finding a counterfeit coin mixed in with seven other coins

An Pascal implementation of an algorithm for Huffman coding, and an explanatory paper, is available from

A brief description of preorder, inorder, and postorder traversals and code that can be used for each of these traversals can be found at

Details about how calculators use reverse Polish notation can be found at the online HP Museum of Calculators. In particular, consult the pages

You can learn more about the life and work of Jan Lukawiewicz and see a photograph of him at the Polish Philosophy site:

A brief biography and a photograph of Jan Lukawiewicz can also be found at the MacTutor History of Mathematics Archive, University St Andrews, Scotland.

A description and analysis of the bubble sort algorithm can be found at

Source code in C for the insertion shell, the shell sort, and the quick sort is available from the

An introduction to IP multicasting can be found at the Stardust Technologies site

Animation of a depth-first search written using JAWAA (Java and Web Algorithm Animation), developed at Duke University, can be seen at

You can find another animation of a depth-first search at

The Combinatorial Object Server can be used to generate the spanning trees of a graph

Animation of a breadth-first search can be seen at

Another animated breadth-first search can be seen at

An interesting paper Queens on a Chessboard: Making the Best of a Bad Situation

about the n-queens problem and source code for solving this problem can be found at

You can generate all the solutions to the n-queens problem at the Combinatorial Objects Server site.

You can download software (not reviewed by the author) for the n-queens puzzle from

Page 583

The home page of Joseph Kruskal can be found at

Information about B-trees and related software are available at the Combinatorial Object Server.

A detailed description of B-trees and implementations of B-tree can be found at the Sorting and Searching Algorithms: A Cookbook written by Thomas Niemann. The material on B-trees can be found in the Very Large Files chapter of the site.

feedback form | permissions | international | locate your campus rep | request a review copy

digital solutions | publish with us | customer service | mhhe home

---

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.