Data Structures and Algorithm Analysis
data Structures and Algorithm Analysis Edition (Java Version). Clifford A. Shaffer Department of Computer Science Virginia Tech Blacksburg, VA 24061. March 28, 2013. Update For a list of changes, see shaffer/ Copyright 2009-2012 by Clifford A. Shaffer. This document is made freely available in PDF form for educational and other non-commercial use. You may make copies of this file and redistribute in electronic form without charge. You may extract portions of this document provided that the front page, including the title, author, and this notice are included. Any commercial use of this document requires the written consent of the author. The author can be reached at If you wish to have a printed version of this document, print copies are published by Dover Publications (see ). Further information about this text is available at shaffer/Book/. Contents Preface xiii I Preliminaries 1. 1 data Structures and Algorithms 3. A Philosophy of data Structures 4.
8 File Processing and External Sorting 265 8.1 Primary versus Secondary Storage 265 8.2 Disk Drives 268 8.2.1 Disk Drive Architecture 268 8.2.2 Disk Access Costs 272 8.3 Buffers and Buffer Pools 274 8.4 The Programmer’s View of Files 282 8.5 External Sorting 283 8.5.1 Simple Approaches to External Sorting 285 8.5.2 Replacement Selection 288
Download Data Structures and Algorithm Analysis
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: