Algorithmics: The Spirit of Computing
Providing a thorough, well-written and thoughtful study of the fundamental theoretical ideas of computing and examining how to design accurate and efficient algorithms, this book is ideal for an introductory course emphasizing theory rather than programming.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Methods and Analysis
The efficiency of algorithms
6 other sections not shown
actually additional algorithmic problem Alice allowed answer appear applications assume become bound called cards carried Chapter colors comparisons complexity considered consists construct contains correctness CRUZ data structures decidable defined described discussed elements example execution exists fact Figure finite function given graph halting hence infinite input instructions integer interested involves kind language length logical loop means method models move nodes operations output parallel performance positive possible precisely processors programming language proof prove question reasonable recursive represent result salary SANTA sequence simple solution solve sorting statement string structure subroutine symbols tape terminate testing things tile tree true Turing machine undecidable University University Library variable verify write