Guerilla Data Analysis Using Microsoft Excel or The Art of Computer Programming

Guerilla Data Analysis Using Microsoft Excel

Author: Bill Jelen

This book includes step-by-step examples and case studies that teach users the many power tricks for analyzing data in Excel. These are tips honed by Bill Jelen, “MrExcel,” during his 10-year run as a financial analyst charged with taking mainframe data and turning it into useful information quickly. Topics include perfectly sorting with one click every time, matching lists of data, data consolidation, data subtotals, pivot tables, and much more.

Go to: Le Règlement de Commerce international

The Art of Computer Programming, Vol. 3

Author: Donald E Knuth

The first revision of this third volume is the most comprehensive survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume 1 to consider both large and small databases and internal and external memories. The book contains a selection of carefully checked computer methods, with a quantitative analysis of their efficiency. Outstanding features of the second edition include a revised section on optimum sorting and new discussions of the theory of permutations and of universal hashing.

Booknews

Knuth is eminent for his pioneering work on algorithms and programming techniques, for his invention of TEX and METAFONT systems for computer typesetting, and for his prolific and influential writing. This volume, revised from its 1980 version and the second of what will be a seven-volume work, offers a complete introduction to the field of seminumerical algorithms, with separate chapters on random numbers and arithmetic. Summarizing the major paradigms and basic theory of such algorithms, it provides a comprehensive interface between computer programming and numerical analysis. Noteworthy in this edition is Knuth's new treatment of random number generators, and his discussion of calculations with formal power series. Annotation c. by Book News, Inc., Portland, Or.

Booknews

This last volume in a set of three surveys classical computer techniques for sorting and searching, considering both large and small databases and internal and external memories. Recently updated to reflect new developments in the field, the volume also contains several hundred new exercises. This new edition of Volume Three is described as matching Volume One (3rd edition) covering fundamental algorithms and Volume Two (3rd edition) treating seminumerical algorithms. Annotation c. by Book News, Inc., Portland, Or.

Table of Contents:

5. Sorting.
Combinatorial Properties of Permutations.
Inversions.
Permutations of a Multiset.
Runs.
Tableaux and Involutions.

Internal sorting.
Sorting by Insertion.
Sorting by Exchanging.
Sorting by Selection.
Sorting by Merging.
Sorting by Distribution.

Optimum Sorting.
Minimum-Comparison Sorting.
Minimum-Comparison Merging.
Minimum-Comparison Selection.
Networks for Sorting.

External Sorting.
Multiway Merging and Replacement Selection.
The Polyphase Merge.
The Cascade Merge.
Reading Tape Backwards.
The Oscillating Sort.
Practical Considerations for Tape Merging.
External Radix Sorting.
Two-Tape Sorting.
Disks and Drums.

Summary, History, and Bibliography.

6. Searching.
Sequential Searching.
Searching by Comparison of Keys.
Searching an Ordered Table.
Binary Tree Searching.
Balanced Trees.
Multiway Trees.

Digital Searching.
Hashing.
Retrieval on Secondary Keys.

Answers to Exercises.
Appendix A: Tables of Numerical Quantities.
Fundamental Constants (decimal).
Fundamental Constants (octal).
Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers.

Appendix B: Index to Notations.
Index and Glossary.