- Chapter
Chapter 6: Analysis of Algorithms
pp. 267-326- Add bookmark
- Cite
- Share
Summary
Computer scientists are speed demons. When we are confronted by acomputational problem that we need to solve, we want to solve that problemas quickly as possible. That “need for speed” has driven muchof the advancement in computation over the last 50 years. We discover fasterways of solving important problems: developing data structures that supportapparently instantaneous search of billions of tweets or billions of userson a social networking site; or discovering new, faster algorithms thatsolve practical problems—such as finding shorter routes for deliverydrivers or encrypting packets to be sent over the internet.
About the book
- Chapter DOI https://doi.org/10.1017/9781009150484.006
- Book DOI https://doi.org/10.1017/9781009150484
- Subjects Algorithms, Complexity, and Theory of Computing,Computer Science,Discrete Mathematics Information Theory and Coding,Mathematics
- Format: Hardback
- Publication date: 03 November 2022
- ISBN: 9781009150491
- Format: Digital
- Publication date: 16 December 2022
- ISBN: 9781009150484
- Find out more details about this book
Access options
Review the options below to login to check your access.
Personal login
Log in with your Cambridge Higher Education account to check access.
Purchase options
If you believe you should have access to this content, please contact your institutional librarian or consult our FAQ page for further information about accessing our content.