Skip to main content

Algorithms and Listings

  • Chapter
  • First Online:
LaTeX and Friends

Part of the book series: X.media.publishing ((XMEDIAPUBL))

  • 11k Accesses

Abstract

Algorithms are ubiquitous in computer science papers. Knowing how to present your algorithms increases the chance of getting your ideas across. This chapter explains how to typeset pseudo-code with the algorithm2e package and how to present verbatim program listings with the listings package.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 99.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

van Dongen, M.R.C. (2012). Algorithms and Listings. In: LaTeX and Friends. X.media.publishing. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23816-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23816-1_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23815-4

  • Online ISBN: 978-3-642-23816-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics