Google Search
Jana Berlit
Secretary
Contact
Technische Universität Ilmenau
Department of Computer Science and Automation
Institute of Theoretical Computer Science
Helmholtzplatz 5 (Zusebau, room 1046)
98693 Ilmenau
+49 3677 69 - 2655
fg-theorie@tu-ilmenau.de
office hours
Mon, Tue, Thur, Fri: 08:30 - 11:00 am, and by appointment
Example-oriented introduction to algorithms
Illustrates the basic principles of algorithm design with interesting applications
Gives an overview of 43 important algorithms
Behind many programs are clever procedures, which are called algorithms. Algorithms not only solve mathematical problems that deal with numbers, but also other, quite everyday problems that require logical intuition, spatial orientation or clever negotiation, for example:
How can the shortest route between two places be determined?
How should pirates divide up a treasure map, or bank employees the secret code of the safe?
How can several hungry party guests divide a cake fairly among themselves?
This book takes you on a tour of the fascinating world of algorithms. It requires no prior knowledge, so students in middle school and above and laypeople interested in computer science can gain new and surprising insights. In 43 articles by computer scientists who teach at universities in Germany and abroad, important and particularly elegant algorithms are explained in a clear and colloquial manner.
Keywords " algorithms - algorithm - alphabet - trees - computers - graphs - computer science - cryptography - programming - knapsack problem - sorting algorithms - sorting - search - dynamic programming