Skip to main content

Procedures and Functions

  • Chapter
  • First Online:
Book cover Beginning Ada Programming
  • 766 Accesses

Abstract

This chapter will introduce the basic concepts of encapsulating your code into containers that can be used later. Think about it; if you wrote a sorting algorithm that would be able to organize a bunch of values from largest to smallest, you would need to repeat the entire algorithm elsewhere if you wanted to use it in other parts of the application. This does not make any sense. Furthermore, if you have a bug in your algorithm, you would need to go over every single copy of it and fix it. What a waste of time!

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Andrew T. Shvets

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Shvets, A.T. (2020). Procedures and Functions. In: Beginning Ada Programming. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-5428-8_4

Download citation

Publish with us

Policies and ethics