ISC-4221
Revision as of 05:17, 26 August 2014 by Peter Beerli (talk | contribs) (→Discrete Algorithms in Scientific Computing)
Discrete Algorithms in Scientific Computing
In this course we are mainly interested in problems of a discrete nature such as searching for a text string, sorting a list of objects, finding the optimal path between cities, finding the point from a list which is closest to a given point, simulating a random process, etc.
