Skip to main content

Searching

  • Chapter
  • 29 Accesses

Abstract

This chapter, and the next two, use algorithms for searching and for sorting unordered data. We have broken the topic into three chapters as a way to focus on the problem solution aspects rather than on details of searching and sorting techniques. You should gain problem solving and programming experience by studying and understanding the sample algorithms and programs given in this chapter, and by working out the exercises.

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

Buying options

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 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

Learn about 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

© 1984 SPringer-Verlag New York Inc.

About this chapter

Cite this chapter

Bowles, K.L., Franklin, S.D., Volper, D.J. (1984). Searching. In: Problem Solving Using UCSD Pascal. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-5194-1_14

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-5194-1_14

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-90822-9

  • Online ISBN: 978-1-4612-5194-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics