| 000 | 01361 a2200169 4500 | ||
|---|---|---|---|
| 003 | Nust | ||
| 005 | 20170207154014.0 | ||
| 020 | _aO201066726 | ||
| 040 | _cNust | ||
| 082 | _a519.4 | ||
| 100 | _aSedgwick, Robert | ||
| 245 |
_aAlgorithms- (E-BOOK) _cRobert Sedgewick |
||
| 260 |
_aNew York _bAddision Wesley _c1983 |
||
| 300 | _a560 p. | ||
| 505 | _aIntroduction 1. Preview Mathematical Algorithms 2. Arithmetic 3. Random Numbers 4. Polynomials 5. Gaussian Elimination 6. Curve Fitting 7. Integration Sorting 8. Elementary Sorting Methods 9. Quicksort 10. Radix Sorting 11. Priority Queues 12. Selection and Merging 13. External Sorting SEARCHIN 14. Elementary Searching Methods 15. Balanced Trees 16. Hashing 17. Radix Searching 18. External Searching String Processing 19. String Searching 20. Pattern Matching 21. Parsing 22. File Compression 23. Cryptology Geometric Algorithms 24. Elementary Geometric Methods 25. Finding the Convex Hull 26 Range Searching 27. Geometric Intersection 28. Closest Point Problems GRAPH ALGORITHMS 29. Elementary Graph Algorithms 30. Connectivity 31. Weighted Graphs 32. Directed Graphs 33. Network Flow 34. Matching Advanced Topics 35. Algorithm Machines 36. The Fast Fourier Transform 37. Dynamic Programming 38. Linear Programming 39. Exhaustive Search 40. NP-complete Problems | ||
| 650 | _aE-BOOK | ||
| 942 |
_2ddc _cBK |
||
| 999 |
_c191364 _d191364 |
||