|
|
|
|
| LEADER |
02912cam a2200601 4500 |
| 001 |
PPN011460016 |
| 003 |
http://www.sudoc.fr/011460016 |
| 005 |
20210129055300.0 |
| 010 |
|
|
|a 0-201-06673-4
|b rel.
|
| 020 |
|
|
|a US
|b 87-36435
|
| 035 |
|
|
|a (OCoLC)489837354
|
| 035 |
|
|
|a ocm17328293
|
| 035 |
|
|
|z ocm19537470
|
| 035 |
|
|
|a ocm32055835
|
| 035 |
|
|
|a sib0448025
|
| 035 |
|
|
|a sib0582942
|
| 035 |
|
|
|a cor0014006
|
| 073 |
|
1 |
|a 9780201066739
|
| 100 |
|
|
|a 19941116h19881988k y0frey0103 ba
|
| 101 |
0 |
|
|a eng
|
| 102 |
|
|
|a US
|
| 105 |
|
|
|a a a 001yy
|
| 106 |
|
|
|a r
|
| 181 |
|
|
|6 z01
|c txt
|2 rdacontent
|
| 181 |
|
1 |
|6 z01
|a i#
|b xxxe##
|
| 182 |
|
|
|6 z01
|c n
|2 rdamedia
|
| 182 |
|
1 |
|6 z01
|a n
|
| 183 |
|
1 |
|6 z01
|a nga
|2 rdacarrier
|
| 200 |
1 |
|
|a Algorithms
|f Robert Sedgewick
|
| 205 |
|
|
|a Second edition
|
| 210 |
|
|
|a Reading (Mass.) [etc.]
|c Addison-Wesley
|d copyright 1988
|
| 215 |
|
|
|a 1 vol. (XII-657 p.)
|c ill., couv. ill. en coul.
|d 25 cm
|
| 225 |
2 |
|
|a Addison-Wesley series in computer science
|
| 305 |
|
|
|a Autre tirage : 1989 (avec correction)
|
| 320 |
|
|
|a Notes bibliogr. Index
|
| 359 |
2 |
|
|b Fundamentals
|c 1. Introduction
|c 2. Pascal
|c 3. Elementary data structures
|c 4. Trees
|c 5. Recursion
|c 6. Analysis of algorithms
|c 7. Implementation of algorithms
|b Sorting algorithms
|c 8. Elementary sorting methods
|c 9. Quicksort
|c 10. Radix sorting
|c 11. Priority queues
|c 12. Mergesort
|c 13. External sorting
|b Searching algorithms
|c 14. Elementary searching methods
|c 15. Balanced trees
|c 16. Hashing
|c 17. Radix searching
|c 18. External searching
|b String processing
|c 19. String searching
|c 20. Pattern matching
|c 21. Parsing
|c 22. File compression
|c 23. Cryptology
|b Geometric algorithms
|c 24. Elementary geometric methods
|c 25. Finding the convex hull
|c 26. Range searching
|c 27. Geometric intersection
|c 28. Closest-point problems
|b Graph algorithms
|c 29. Elementary graph algorithms
|c 30. Connectivity
|c 31. Weighted graphs
|c 32. Directed graphs
|c 33. Network flow
|c 34. Matching
|b Mathematical algorithms
|c 35. Random numbers
|c 36. Arithmetic
|c 37. Gaussian elimination
|c 38. Curve fitting
|c 39. Integration
|b Advanced topics
|c 40. Parallel algorithms
|c 41. The fast Fourier transform
|c 42. Dynamic programming
|c 43. Linear programming
|c 44. Exhaustive search
|c 45. NP-complete problems
|
| 410 |
|
| |
|0 01329007X
|t Addison-Wesley series in computer science
|
| 606 |
|
|
|3 PPN027282171
|a Algorithmes
|2 rameau
|
| 606 |
|
|
|3 PPN027241378
|a Ordinateurs
|x Programmation
|2 rameau
|
| 676 |
|
|
|a 519.4
|v 19
|
| 676 |
|
|
|a 005.1
|v 22
|z fre
|
| 680 |
|
|
|a QA76.6
|b .S435 1988
|
| 700 |
|
1 |
|3 PPN03086559X
|a Sedgewick
|b Robert
|f 1946-....
|4 070
|
| 801 |
|
1 |
|a US
|b OCLC
|g AACR2
|
| 801 |
|
2 |
|a FR
|b AUROC
|g AFNOR
|
| 801 |
|
1 |
|a US
|b OCLC
|g AACR2
|
| 801 |
|
2 |
|a FR
|b AUROC
|g AFNOR
|
| 801 |
|
3 |
|a FR
|b SF
|g AFNOR
|
| 801 |
|
3 |
|a FR
|b SF
|g AFNOR
|
| 801 |
|
3 |
|a FR
|b Abes
|c 20191114
|g AFNOR
|
| 930 |
|
|
|5 441092208:651365031
|b 441092208
|j u
|
| 979 |
|
|
|a CCFA
|
| 998 |
|
|
|a 860784
|
Nantilus
