01336    a2200157   4500003000500000005001700005020001500022040000900037082001000046100002100056245004300077260003600120300001100156505100000167650001101167Nust20170207154014.0  aO201066726  cNust  a519.4  aSedgwick, Robert  aAlgorithms- (E-BOOK)cRobert Sedgewick  aNew YorkbAddision Wesleyc1983  a560 p.  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  aE-BOOK