Abstract
The core contribution in many papers in computer science is an algorithm. These algorithms are often the product of months of work; the version that the researchers have decided to submit for publication is typically based on a great deal of discussion, brainstorming, prototyping, testing, analysis, and debate over details. Yet in many cases this effort is not reflected in the presentation. Not only are the steps of the algorithm often unclear, but there is no discussion of why the reader should believe that the algorithm is correct or that its behaviour is reasonable. An algorithm by itself is uninteresting; what is of value is an algorithm that has been shown to solve a problem. Issues with presentation of algorithms are the subject of this chapter.
Mostly gobbledygook ...
Eric Partridge, defining computation
Usage and Abusage
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag London
About this chapter
Cite this chapter
Zobel, J. (2004). Algorithms. In: Writing for Computer Science. Springer, London. https://doi.org/10.1007/978-0-85729-422-7_7
Download citation
DOI: https://doi.org/10.1007/978-0-85729-422-7_7
Publisher Name: Springer, London
Print ISBN: 978-1-85233-802-2
Online ISBN: 978-0-85729-422-7
eBook Packages: Springer Book Archive