HOME > 상세정보

상세정보

Handbook of algorithms and data structures : in Pascal and C 2nd ed

Handbook of algorithms and data structures : in Pascal and C 2nd ed (5회 대출)

자료유형
단행본
개인저자
Gonnet, G. H. (Gaston H.) Baeza-Yates, R. (Ricardo).
서명 / 저자사항
Handbook of algorithms and data structures : in Pascal and C / G.H. Gonnet, R. Baeza-Yates.
판사항
2nd ed.
발행사항
Wokingham, England ;   Reading, Mass. :   Addison-Wesley Pub. Co.,   1991.  
형태사항
xiv, 424 p. : ill. ; 25 cm.
총서사항
International computer science series.
ISBN
0201416077 :
서지주기
Includes bibliographical references (p. 309-374) and index.
일반주제명
Pascal (Computer program language). C (Computer program language). Computer algorithms. Data structures (Computer science).
000 01052camuuu200301 a 4500
001 000000109374
005 19980526141544.0
008 901205s1991 enka bf 001 0 eng
010 ▼a 90026318 //r91
020 ▼a 0201416077 : ▼c ?8.95
040 ▼a DLC ▼c DLC
049 1 ▼l 421109105 ▼f 과개
050 0 0 ▼a QA76.73.P2 ▼b G66 1991
082 0 0 ▼a 005.13/3 ▼2 20
090 ▼a 005.133 ▼b G639h2
100 1 ▼a Gonnet, G. H. ▼q (Gaston H.)
245 1 0 ▼a Handbook of algorithms and data structures : ▼b in Pascal and C / ▼c G.H. Gonnet, R. Baeza-Yates.
250 ▼a 2nd ed.
260 ▼a Wokingham, England ; ▼a Reading, Mass. : ▼b Addison-Wesley Pub. Co., ▼c 1991.
300 ▼a xiv, 424 p. : ▼b ill. ; ▼c 25 cm.
440 0 ▼a International computer science series.
504 ▼a Includes bibliographical references (p. 309-374) and index.
650 0 ▼a Pascal (Computer program language).
650 0 ▼a C (Computer program language).
650 0 ▼a Computer algorithms.
650 0 ▼a Data structures (Computer science).
700 2 0 ▼a Baeza-Yates, R. ▼q (Ricardo).

소장정보

No. 소장처 청구기호 등록번호 도서상태 반납예정일 예약 서비스
No. 1 소장처 과학도서관/Sci-Info(2층서고)/ 청구기호 005.133 G639h2 등록번호 421109105 도서상태 대출가능 반납예정일 예약 서비스 B M

컨텐츠정보

목차


CONTENTS
Preface = ⅶ
Chapter 1 INTRODUCTION = 1
 1.1 Structure of the chapters = 1
 1.2 Naming of variables = 3
 1.3 Probabilities = 3
 1.4 Asymptotic notation = 4
 1.5 About the programming languages = 5
 1.6 On the code for the algorithms = 6
 1.7 Complexity measures and real timings = 6
Chapter 2 BASIC CONCEPTS = 8
 2.1 Data structure description = 8
  2.1.1 Grammar for data objects = 8
  2.1.2 Constraints for data objects = 11
 2.2 Algorithm descriptions = 12
  2.2.1 Basic(or atomic) operations = 13
  2.2.2 Building procedures = 14
  2.2.3 Interchangeability = 21
Chapter 3 SEARCHING ALGORITHMS = 23
 3.1 Sequential search = 23
  3.1.1 Basic Sequential search = 23
  3.1.2 Self-organizing Sequential search: Move to Front method = 25
  3.1.3 Self-organizing Sequential search: Transpose method = 28
  3.1.4 Optimal Sequential search = 30
  3.1.5 Jump search = 30
 3.2 Sorted array search = 31
  3.2.1 Binarysearch = 32
  3.2.2 Interpolation search = 34
  3.2.3 Interpolation-Sequential search = 35
 3.3 Hashing = 37
  3.3.1 Uniform probing hashing = 40
  3.3.2 Random probing hashing = 41
  3.3.3 Linear probing hashing = 42
  3.3.4 Double hashing = 45
  3.3.5 Quadratic hashing = 47
 HANDBOOK OF ALGORITHMS AND DATA STRUCTURES
  3.3.6 Ordered hashing = 49
  3.3.7 Reorganization for Uniform probing: Brent's algorithm = 51
  3.3.8 Reorganization for Uniform probing: Binary tree hashing = 53
  3.3.9 Optimal hashing = 55
  3.3.10 Direct chaining hashing = 56
  3.3.11 Separate chaining hashing = 59
  3.3.12 Coalesced hashing = 60
  3.3.13 Extendible hashing = 63
  3.3.14 Linear hashing = 65
  3.3.15 External hashing using minimal internal storage = 67
 3.4 Recursive structures search = 69
  3.4.1 Binary tree search = 69
  3.4.2 B-trees = 90
  3.4.3 Index and indexed sequential files = 101
  3.4.4 Digital trees = 103
 3.5 Multidimensional search = 112
  3.5.1 Quad trees = 112
  3.5.2 K-dimensional trees = 114
Chapter 4 SORTING ALGORITHMS = 118
 4.1 Techniques for sorting arrays = 118
  4.1.1 Bubble sort = 118
  4.1.2 Linear insertion sort = 120
  4.1.3 Quicksort = 121
  4.1.4 Shellsort = 124
  4.1.5 Heapsort = 126
  4.1.6 Interpolation sort = 128
  4.1.7 Linear probing sort = 130
  4.1.8 Summary = 132
 4.2 Sorting other data structures = 133
  4.2.1 Merge sort = 134
  4.2.2 Quicksort for lists = 136
  4.2.3 Bucket sort = 137
  4.2.4 Radix sort = 139
  4.2.5 Hybrid methods of sorting = 141
  4.2.6 Treesort = 142
 4.3 Merging = 144
  4.3.1 List merging = 144
  4.3.2 Array merging = 145
  4.3.3 Minimal-comparison merging = 146
 4.4 External sorting = 147
  4.4.1 Balanced merge sort = 152
  4.4.2 Cascade merge sort = 153
  4.4.3 Polyphase merge sort = 155
  4.4.4 Oscillating merge sort = 158
  4.4.5 External Quicksort = 160
Chapter 5 SELECTION ALGORITHMS = 163
 5.1 Priority queues = 163
  5.1.1 Sorted/unsorted lists = 164
  5.1.2 P-trees = 166
  5.1.3 Heaps = 169
  5.1.4 VanEmde-Boas priority queues = 172
  5.1.5 Pagodas = 174
  5.1.6 Binary trees used as priority queues = 177
  5.1.7 Binomial queues = 181
  5.1.8 Summary = 182
 5.2 Selection of $$k^th$$ = 183
  5.2.1 Selection by sorting = 183
  5.2.2 Selection by tail recursion = 185
  5.2.3 Selection of the mode = 186
Chapter 6 ARITHMETIC ALGORITHMS = 188
 6.1 Basic operations, multiplication / division = 188
 6.2 Other arithmetic functions = 193
  6.2.1 Binary powering = 193
  6.2.2 Arithmetic-geometric mean = 195
  6.2.3 Transcendental functions = 196
 6.3 Matrix multiplication = 198
  6.3.1 Strassen's matrix mulliplication = 199
  6.3.2 Further asymptotic improvements = 200
 6.4 Polynomial evaluation = 201
Appendix Ⅰ Distributions derived from empirical observation = 203
Appendix Ⅱ Asymptotic expansions = 209
Appendix Ⅲ References = 218
Appendix Ⅳ Algorithms coded in Pascal and in C = 254
Index = 279


관련분야 신착자료