MARC 닫기
00000nam c2200205 k 4500
000003586129
20220801152058
010731s1995 US 000 eng
▼a 211070
▼c 211070
▼d 211070
▼l WM0003028905
▼a QA76.73.C153
▼a QA76.73.C153
▼b W553
▼a CLASSICAL ALGORITHMS IN C++/
▼d WILT,NICHOLAS.
▼a NEW YORK:
▼b JOHN WILEY and SONS,
▼c 1995.
▼a 350p.
▼a CLASSICAL
▼a ALGORITHMS
▼a C
▼a WILT,NICHOLAS
▼a 단행본
| 자료유형 : | 단행본 |
|---|---|
| 분류기호 : | QA76.73.C153 |
| 서명/저자사항 : | CLASSICAL ALGORITHMS IN C++/ WILT,NICHOLAS. |
| 발행사항 : | NEW YORK: JOHN WILEY and SONS, 1995. |
| 형태사항 : | 350p. |
| 개인저자 : | WILT,NICHOLAS |
| 언어 | 영어 |
WMO199928596
권 호 : 350
발행년 : 1995
서 명 : CLASSICAL ALGORITHMS IN C++
발행처 : WILT,NICHOLAS
목차
1. ALGORITHMS AND ASYMPTOTIC NOTATION
2. OVERVIEW OF SORTING
3. ASYMPTOTICALLY SLOW SORTS
4. ASYMPTOTICALLY FAST SORTS
5. SORTING WRAPUP
6. OVERVIEW OF SEARCHING
7. SEARCHING ARRAYS
8. LINEAR LISTS
9. SKIP LISTS
10. BINARY TREES
11. RED-BLACK TREES
12. SPLAY TREES
13. SEARCHING WRAPUP
14. LINEAR-TIME SELECTION
15. ORDER STATISTICS TREES
16. SELECTION WRAPUP AND FUTURE WORK
서평쓰기