Book contents
- Frontmatter
- Dedication
- Contents
- Preface
- 1 Introduction
- 2 A Warm-up
- 3 Random Sampling
- 4 List Ranking
- 5 Sorting Atomic Items
- 6 Set Intersection
- 7 Sorting Strings
- 8 The Dictionary Problem
- 9 Searching Strings by Prefix
- 10 Searching Strings by Substring
- 11 Integer Coding
- 12 Statistical Coding
- 13 Dictionary-Based Compressors
- 14 Block-Sorting Compression
- 15 Compressed Data Structures
- 16 Conclusion
- Index
1 - Introduction
Published online by Cambridge University Press: 08 June 2023
Book contents
- Frontmatter
- Dedication
- Contents
- Preface
- 1 Introduction
- 2 A Warm-up
- 3 Random Sampling
- 4 List Ranking
- 5 Sorting Atomic Items
- 6 Set Intersection
- 7 Sorting Strings
- 8 The Dictionary Problem
- 9 Searching Strings by Prefix
- 10 Searching Strings by Substring
- 11 Integer Coding
- 12 Statistical Coding
- 13 Dictionary-Based Compressors
- 14 Block-Sorting Compression
- 15 Compressed Data Structures
- 16 Conclusion
- Index
HTML view is not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.
Summary
This chapter introduces to the concepts of algorithm, model of computation, and computational resources, starting from the classic ones (time and space) and then moving to I/O complexity by introducing the two-level memory model, which constitutes a simple, yet very effective, approximation of modern hierarchical memories. Examples are given in order to motivate the importance of counting I/Os for estimating the real performance of algorithms in modern computers.
- Type
- Chapter
- Information
- Pearls of Algorithm Engineering , pp. 1 - 9Publisher: Cambridge University PressPrint publication year: 2023
You have
Access