在线阅读本书
Capital Ideas traces the origins of modern Wall Street, from the pioneering work of early scholars and the development of new theories in risk, valuation, and investment returns, to the actual implementation of these theories in the real world of investment management. Bernstein brings to life a variety of brilliant academics who have contributed to modern investment theory over the years: Louis Bachelier, Harry Markowitz, William Sharpe, Fischer Black, Myron Scholes, Robert Merton, Franco Modigliani, and Merton Miller. Filled with in–depth insights and timeless advice, Capital Ideas reveals how the unique contributions of these talented individuals profoundly changed the practice of investment management as we know it today.

It's the People, Stupid!
Karen Phelan is sorry. She really is. She tried to do business by the numbers--the management consultant way--developing measures, optimizing processes, and quantifying performance. The only problem is that businesses are run by people. And people can't be plugged into formulas or summed up in scorecards.
Phelan dissects a whole range of consulting treatments for unhealthy companies and shows why they're essentially fad diets: superficial would-be fixes that don't result in lasting improvements and can cause serious damage. With a mix of clear-eyed business analysis, heart-wrenching stories, and hard-won lessons for both consultants and the people who hire them, this book is impossible to put down and impossible to ignore. Karen Phelan and other consultants may have "broken" your company, but she's eager to make amends. "Finally, an author challenging our broken management models who has credibility--she has been there. Karen Phelan not only explains why the emperor--our sacred ways of managing--has no clothes but provides us with insightful alternatives that promise to add real value to our organizations and the people that make them function."
--Dean Schroeder, award-winning coauthor of Ideas Are Free
"Funny, irreverent, and outrageous, this book is making a deeply serious point: talking to actual people and figuring out how to help them work together better is what's going to make organizations stronger, not another PowerPoint presentation."
--Rosina L. Racioppi, President and CEO, Women Unlimited, Inc.

This book offers robust solutions for everyday programming tasks, providing all the necessary information to
understand and use common programming techniques. It includes implementations and real-world examples of
each data structure in the text and full source code on the accompanying website
(http://examples.oreilly.com/masteralgoc/). Intended for anyone with a basic understanding of the C language.
Preface
When I first thought about writing this book, I immediately thought of O'Reilly & Associates to publish it. They were the first publisher
I contacted, and the one I most wanted to work with because of their tradition of books covering "just the facts." This approach is not
what one normally thinks of in connection with books on data structures and algorithms. When one studies data structures and
algorithms, normally there is a fair amount of time spent on proving their correctness rigorously. Consequently, many books on this
subject have an academic feel about them, and real details such as implementation and application are left to be resolved
elsewhere. This book covers how and why certain data structures and algorithms work, real applications that use them (including
many examples), and their implementation. Mathematical rigor appears only to the extent necessary in explanations.
Naturally, I was very happy that O'Reilly & Associates saw value in a book that covered this aspect of the subject. This preface
contains some of the reasons I think you will find this book valuable as well. It also covers certain aspects of the code in the book,
defines a few conventions, and gratefully acknowledges the people who played a part in the book's creation.
Bookmarks
Main Page
Table of content
Copyright
Preface
Organization
Key Features
About the Code
Conventions
How to Contact Us
Acknowledgments
Part I: Preliminaries
Chapter 1. Introduction
1.1 An Introduction to Data Structures
1.2 An Introduction to Algorithms
1.3 A Bit About Software Engineering
1.4 How to Use This Book
Chapter 2. Pointer Manipulation
2.1 Pointer Fundamentals
2.2 Storage Allocation
2.3 Aggregates and Pointer Arithmetic
2.4 Pointers as Parameters to Functions
2.5 Generic Pointers and Casts
2.6 Function Pointers
2.7 Questions and Answers
2.8 Related Topics
Chapter 3. Recursion
3.1 Basic Recursion
3.2 Tail Recursion
3.3 Questions and Answers
3.4 Related Topics
Chapter 4. Analysis of Algorithms
4.1 Worst-Case Analysis
4.2 O-Notation
4.3 Computational Complexity
4.4 Analysis Example: Insertion Sort
4.5 Questions and Answers
4.6 Related Topics
Part II: Data Structures
Chapter 5. Linked Lists
5.1 Description of Linked Lists
5.2 Interface for Linked Lists
5.3 Implementation and Analysis of Linked Lists
5.4 Linked List Example: Frame Management
5.5 Description of Doubly-Linked Lists
5.6 Interface for Doubly-Linked Lists
5.7 Implementation and Analysis of Doubly Linked Lists
5.8 Description of Circular Lists
5.9 Interface for Circular Lists
5.10 Implementation and Analysis of Circular Lists
5.11 Circular List Example: Second-Chance Page Replacement
5.12 Questions and Answers
5.13 Related Topics
Chapter 6. Stacks and Queues
6.1 Description of Stacks
6.2 Interface for Stacks
6.3 Implementation and Analysis of Stacks
6.4 Description of Queues
6.5 Interface for Queues
6.6 Implementation and Analysis of Queues
6.7 Queue Example: Event Handling
6.8 Questions and Answers
6.9 Related Topics
Chapter 7. Sets
7.1 Description of Sets
7.2 Interface for Sets
7.3 Implementation and Analysis of Sets
7.4 Set Example: Set Covering
7.5 Questions and Answers
7.6 Related Topics
Chapter 8. Hash Tables
8.1 Description of Chained Hash Tables
8.2 Interface for Chained Hash Tables
8.3 Implementation and Analysis of Chained Hash Tables
8.4 Chained Hash Table Example: Symbol Tables
8.5 Description of Open-Addressed Hash Tables
8.6 Interface for Open-Addressed Hash Tables
8.7 Implementation and Analysisof Open Addressed Hash Tables
8.8 Questions and Answers
8.9 Related Topics
Chapter 9. Trees
9.1 Description of Binary Trees
9.2 Interface for Binary Trees
9.3 Implementation and Analysis of Binary Trees
9.4 Binary Tree Example: Expression Processing
9.5 Description of Binary Search Trees
9.6 Interface for Binary Search Trees
9.7 Implementation and Analysis of Binary Search Trees
9.8 Questions and Answers
9.9 Related Topics
Chapter 10. Heaps and Priority Queues
10.1 Description of Heaps
10.2 Interface for Heaps
10.3 Implementation and Analysis of Heaps
10.4 Description of Priority Queues
10.5 Interface for Priority Queues
10.6 Implementation and Analysis of Priority Queues
10.7 Priority Queue Example: Parcel Sorting
10.8 Questions and Answers
10.9 Related Topics
Chapter 11. Graphs
11.1 Description of Graphs
11.2 Interface for Graphs
11.3 Implementation and Analysis of Graphs
11.4 Graph Example: Counting Network Hops
11.5 Graph Example: Topological Sorting
11.6 Questions and Answers
11.7 Related Topics
Part III: Algorithms
Chapter 12. Sorting and Searching
12.1 Description of Insertion Sort
12.2 Interface for Insertion Sort
12.3 Implementation and Analysis of Insertion Sort
12.4 Description of Quicksort
12.5 Interface for Quicksort
12.6 Implementation and Analysis of Quicksort
12.7 Quicksort Example: Directory Listings
12.8 Description of Merge Sort
12.9 Interface for Merge Sort
12.10 Implementation and Analysis of Merge Sort
12.11 Description of Counting Sort
12.12 Interface for Counting Sort
12.13 Implementation and Analysis of Counting Sort
12.14 Description of Radix Sort
12.15 Interface for Radix Sort
12.16 Implementation and Analysis of Radix Sort
12.17 Description of Binary Search
12.18 Interface for Binary Search
12.19 Implementation and Analysis of Binary Search
12.20 Binary Search Example: Spell Checking
12.21 Questions and Answers
12.22 Related Topics
Chapter 13. Numerical Methods
13.1 Description of Polynomial Interpolation
13.2 Interface for Polynomial Interpolation
13.3 Implementation and Analysis of Polynomial Interpolation
13.4 Description of Least-Squares Estimation
13.5 Interface for Least-Squares Estimation
13.6 Implementation and Analysis of Least-Squares Estimation
13.7 Description of the Solution of Equations
13.8 Interface for the Solution of Equations
13.9 Implementation and Analysis of the Solution of Equations
13.10 Questions and Answers
13.11 Related Topics
Chapter 14. Data Compression
14.1 Description of Bit Operations
14.2 Interface for Bit Operations
14.3 Implementation and Analysis of Bit Operations
14.4 Description of Huffman Coding
14.5 Interface for Huffman Coding
14.6 Implementation and Analysis of Huffman Coding
14.7 Huffman Coding Example: Optimized Networking
14.8 Description of LZ77
14.9 Interface for LZ77
14.10 Implementation and Analysis of LZ77
14.11 Questions and Answers
14.12 Related Topics
Chapter 15. Data Encryption
15.1 Description of DES
15.2 Interface for DES
15.3 Implementation and Analysis of DES
15.4 DES Example: Block Cipher Modes
15.5 Description of RSA
15.6 Interface for RSA
15.7 Implementation and Analysis of RSA
15.8 Questions and Answers
15.9 Related Topics
Chapter 16. Graph Algorithms
16.1 Description of Minimum Spanning Trees
16.2 Interface for Minimum Spanning Trees
16.3 Implementation and Analysis of Minimum Spanning Trees
16.4 Description of Shortest Paths
16.5 Interface for Shortest Paths
16.6 Implementation and Analysis of Shortest Paths
16.7 Shortest Paths Example: Routing Tables
16.8 Description of the Traveling-Salesman Problem
16.9 Interface for the Traveling-Salesman Problem
16.10 Implementation and Analysis of the Traveling-Salesman Problem
16.11 Questions and Answers
16.12 Related Topics
Chapter 17. Geometric Algorithms
17.1 Description of Testing Whether Line Segments Intersect
17.2 Interface for Testing Whether Line Segments Intersect
17.3 Implementation and Analysis of Testing Whether Line Segments Intersect
17.4 Description of Convex Hulls
17.5 Interface for Convex Hulls
17.6 Implementation and Analysis of Convex Hulls
17.7 Description of Arc Length on Spherical Surfaces
17.8 Interface for Arc Length on Spherical Surfaces
17.9 Implementation and Analysis of Arc Length on Spherical Surfaces
17.10 Arc Length Example: Approximating Distances on Earth
17.11 Questions and Answers
17.12 Related Topics
Colophon
index

Robert Sedgewick has thoroughly rewritten and substantially expanded and updated his popular work to provide current and comprehensive coverage of important algorithms and data structures. Christopher Van Wyk and Sedgewick have developed new C++ implementations that both express the methods in a concise and direct manner, and also provide programmers with the practical means to test them on real applications. Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers! This particular book, Parts 1n4, represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. Although the substance of the book applies to programming in any language, the implementations by Van Wyk and Sedgewick also exploit the natural match between C++ classes and ADT implementations. Highlights * Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures * Greater emphasis on abstract data types (ADTs), modular programming, object-oriented programming, and C++ classes than in previous editions * Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations * New implementations of binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and much more * Increased quantitative information about the algorithms, giving you a basis for comparing them * Over 1000 new exercises to help you learn the properties of algorithms Whether you are learning the algorithms for the first time or wish to have up-to-date reference material that incorporates new programming styles with classic and new algorithms, you will find a wealth of useful information in this book.

This book contains profiles of some of America's richest people and how they got that way - and how you can too. While we can't promise that this book will elevate you to the ranks of the super-rich, we can say that within its pages you'll discover everything you need to know about how, exactly, many of America's most famous (and infamous) millionaires and billionaires acquired their fortunes. The big surprise is that all of the super-wealthy it profiles got where they are today by taking one of just ten possible roads-including starting a business, buying real estate, investing wisely, and marrying extremely well. Whether you aspire to shameful wealth or just a demure fortune, bestselling author and self-made billionaire, Ken Fisher, will show you how to walk in the footsteps of tycoons-all the way to the financial success you dream of and deserve. Packed with amusing anecdotes of individuals who have traveled (or tumbled) down each road to wealth. It extracts valuable lessons on how you, too, can achieve serious wealth, and, just as importantly, hold onto it. It provides powerful tools for determining what you need to do to position yourself for success and "Guideposts" and "Warning Signs" to help keep you safely on your road to success. The Second Edition features more profiles and instructive examples than were found in the bestselling first edition.

Fisher was one of America’s greatest mathematical economists. This book is still used a textbook and is an outstanding example of clearly written economic theory.

Peter Seibel interviews 15 of the most interesting computer programmers alive today in Coders at Work, offering a companion volume to Apress's highly acclaimed best-seller Founders at Work by Jessica Livingston. As the words "at work" suggest, Peter Seibel focuses on how his interviewees tackle the day-to-day work of programming, while revealing much more, like how they became great programmers, how they recognize programming talent in others, and what kinds of problems they find most interesting. Hundreds of people have suggested names of programmers to interview on the Coders at Work web site: www.codersatwork.com. The complete list was 284 names. Having digested everyone's feedback, we selected 15 folks who've been kind enough to agree to be interviewed: * Frances Allen: Pioneer in optimizing compilers, first woman to win the Turing Award (2006) and first female IBM fellow * Joe Armstrong: Inventor of Erlang * Joshua Bloch: Author of the Java collections framework, now at Google * Bernie Cosell: One of the main software guys behind the original ARPANET IMPs and a master debugger * Douglas Crockford: JSON founder, JavaScript architect at Yahoo! * L. Peter Deutsch: Author of Ghostscript, implementer of Smalltalk-80 at Xerox PARC and Lisp 1.5 on PDP-1 * Brendan Eich: Inventor of JavaScript, CTO of the Mozilla Corporation * Brad Fitzpatrick: Writer of LiveJournal, OpenID, memcached, and Perlbal * Dan Ingalls: Smalltalk implementor and designer * Simon Peyton Jones: Coinventor of Haskell and lead designer of Glasgow Haskell Compiler * Donald Knuth: Author of The Art of Computer Programming and creator of TeX * Peter Norvig: Director of Research at Google and author of the standard text on AI * Guy Steele: Coinventor of Scheme and part of the Common Lisp Gang of Five, currently working on Fortress * Ken Thompson: Inventor of UNIX * Jamie Zawinski: Author of XEmacs and early Netscape/Mozilla hacker What you'll learnHow the best programmers in the world do their jobs! Who this book is for Programmers interested in the point of view of leaders in the field. Programmers looking for approaches that work for some of these outstanding programmers. Table of Contents * Jamie Zawinski * Brad Fitzpatrick * Douglas Crockford * Brendan Eich * Joshua Bloch * Joe Armstrong * Simon Peyton Jones * Peter Norvig * Guy Steele * Dan Ingalls * L Peter Deutsch * Ken Thompson * Fran Allen * Bernie Cosell * Donald Knuth

In order to thoroughly understand what makes Linux tick and why it works so well on a wide variety of systems, you need to delve deep into the heart of the kernel. The kernel handles all interactions between the CPU and the external world, and determines which programs will share processor time, in what order. It manages limited memory so well that hundreds of processes can share the system efficiently, and expertly organizes data transfers so that the CPU isn't kept waiting any longer than necessary for the relatively slow disks. The third edition of Understanding the Linux Kernel takes you on a guided tour of the most significant data structures, algorithms, and programming tricks used in the kernel. Probing beyond superficial features, the authors offer valuable insights to people who want to know how things really work inside their machine. Important Intel-specific features are discussed. Relevant segments of code are dissected line by line. But the book covers more than just the functioning of the code; it explains the theoretical underpinnings of why Linux does things the way it does. This edition of the book covers Version 2.6 , which has seen significant changes to nearly every kernel subsystem, particularly in the areas of memory management and block devices. The book focuses on the following topics: * Memory management, including file buffering, process swapping, and Direct memory Access (DMA) * The Virtual Filesystem layer and the Second and Third Extended Filesystems * Process creation and scheduling * Signals, interrupts, and the essential interfaces to device drivers * Timing * Synchronization within the kernel * Interprocess Communication (IPC) * Program execution Understanding the Linux Kernel will acquaint you with all the inner workings of Linux, but it's more than just an academic exercise. You'll learn what conditions bring out Linux's best performance, and you'll see how it meets the challenge of providing good system response during process scheduling, file access, and memory management in a wide variety of environments. This book will help you make the most of your Linux system.

Even bad code can function. But if code isn’t clean, it can bring a development organization to its knees. Every year, countless hours and significant resources are lost because of poorly written code. But it doesn’t have to be that way.
Noted software expert Robert C. Martin presents a revolutionary paradigm with Clean Code: A Handbook of Agile Software Craftsmanship. Martin has teamed up with his colleagues from Object Mentor to distill their best agile practice of cleaning code “on the fly” into a book that will instill within you the values of a software craftsman and make you a better programmer—but only if you work at it.
What kind of work will you be doing? You’ll be reading code—lots of code. And you will be challenged to think about what’s right about that code, and what’s wrong with it. More importantly, you will be challenged to reassess your professional values and your commitment to your craft.
Clean Code is divided into three parts. The first describes the principles, patterns, and practices of writing clean code. The second part consists of several case studies of increasing complexity. Each case study is an exercise in cleaning up code—of transforming a code base that has some problems into one that is sound and efficient. The third part is the payoff: a single chapter containing a list of heuristics and “smells” gathered while creating the case studies. The result is a knowledge base that describes the way we think when we write, read, and clean code.
Readers will come away from this book understanding
How to tell the difference between good and bad code
How to write good code and how to transform bad code into good code
How to create good names, good functions, good objects, and good classes
How to format code for maximum readability
How to implement complete error handling without obscuring code logic
How to unit test and practice test-driven development
This book is a must for any developer, software engineer, project manager, team lead, or systems analyst with an interest in producing better code.

In his thousand-day presidency, John F. Kennedy led America throuh one of its most difficult and potentially explosive areas. With the Cold War at its height and the threat of communist advances in Europe and the Third World, Kennedy had the unenviable task of maintaining US solidarity without leading the western world into a nuclear catastrophe. In 'Kennedy's Wars', noted historian Lawrence Freedman draws on the best of Cold War scholarship and newly released government documents to illuminate Kennedy's approach to war and his efforts for peace. He recreates insightfully the political and intellectual milieu of the foreign policy establishment during Kennedy's era with vivid profiles of his top advisors - Robert McNamara, Dean Rusk, Robert Kennedy - and influential figures such as Dean Acheson and Walt Rostow. Tracing the evolution of traditional liberalism into the Cold War liberalism of Kennedy's cabinet, Freedman evaluates their responses to the tensions in Berlin, Cuba, Laos, and Vietnam. He gives each conflict individual attention, showing how foreign policy decisions came to be defined for each new crisis in the light of those that had gone before. Readers will follow Kennedy as he wrestles with the succession of major conflicts - taking advice, weighing the risks of inadvertently escalating the Cold War into outright military confrontation, exploring diplomatic options, and forming strategic judgements that would eventually prevent a major war during his presidency. 'Kennedy's Wars' offers a dynamic and human portrait of Kennedy under pressure: a political leader shaped by the ideas of his time, conscious of his vulnerability to electoral defeat but also of his nation's vulnerability to nuclear war. Military and Kennedy enthusiasts will find its balanced consideration of the president's foreign policy and provocative 'what if' scenarios invaluable keys to understanding his accomplishments, failures, and enduring legacy.

The gap between rich and poor has never been wider…legislative stalemate paralyzes the country…corporations resist federal regulations…spectacular mergers produce giant companies…the influence of money in politics deepens…bombs explode in crowded streets…small wars proliferate far from our shores…a dizzying array of inventions speeds the pace of daily life.
These unnervingly familiar headlines serve as the backdrop for Doris Kearns Goodwin’s highly anticipated The Bully Pulpit—a dynamic history of the first decade of the Progressive era, that tumultuous time when the nation was coming unseamed and reform was in the air.
The story is told through the intense friendship of Theodore Roosevelt and William Howard Taft—a close relationship that strengthens both men before it ruptures in 1912, when they engage in a brutal fight for the presidential nomination that divides their wives, their children, and their closest friends, while crippling the progressive wing of the Republican Party, causing Democrat Woodrow Wilson to be elected, and changing the country’s history.
The Bully Pulpit is also the story of the muckraking press, which arouses the spirit of reform that helps Roosevelt push the government to shed its laissez-faire attitude toward robber barons, corrupt politicians, and corporate exploiters of our natural resources. The muckrakers are portrayed through the greatest group of journalists ever assembled at one magazine—Ida Tarbell, Ray Stannard Baker, Lincoln Steffens, and William Allen White—teamed under the mercurial genius of publisher S. S. McClure.
Goodwin’s narrative is founded upon a wealth of primary materials. The correspondence of more than four hundred letters between Roosevelt and Taft begins in their early thirties and ends only months before Roosevelt’s death. Edith Roosevelt and Nellie Taft kept diaries. The muckrakers wrote hundreds of letters to one another, kept journals, and wrote their memoirs. The letters of Captain Archie Butt, who served as a personal aide to both Roosevelt and Taft, provide an intimate view of both men.
The Bully Pulpit, like Goodwin’s brilliant chronicles of the Civil War and World War II, exquisitely demonstrates her distinctive ability to combine scholarly rigor with accessibility. It is a major work of history—an examination of leadership in a rare moment of activism and reform that brought the country closer to its founding ideals.

The United States is locked into three prolonged conflicts without much hope of early resolution. Iran is pursuing a nuclear programme; the aftermath of the overthrow of Saddam Hussein has seen unrelenting intercommunal violence; and the Taliban have got back into Afghanistan. Lawrence Freedman teases out the roots of each engagement over the last thirty years and demonstrates with clarity and scholarship the influence of these conflicts upon each other. The story is complex and often marked by great drama. First, the countries in dispute with America are not themselves natural allies; second, their enmity was not, at first, America's choice. Third, the region's problems cannot all be traced to the Arab-Israeli dispute. Unique in its focus, this book will offer not only new revelations but also remind us of what has been forgotten or has never been put in context.

Americans have long been taught that events such as the notorious My Lai massacre were isolated incidents in the Vietnam War, carried out by just a few "bad apples." But as award-winning journalist and historian Nick Turse demonstrates in this groundbreaking investigation, violence against Vietnamese noncombatants was not at all exceptional during the conflict. Rather, it was pervasive and systematic, the predictable consequence of official orders to "kill anything that moves."
Drawing on more than a decade of research into secret Pentagon archives and extensive interviews with American veterans and Vietnamese survivors, Turse reveals for the first time the workings of a military machine that resulted in millions of innocent civilians killed and wounded-what one soldier called "a My Lai a month." Devastating and definitive,
finally brings us face-to-face with the truth of a war that haunts America to this day.

This description of the symbiotic relationships among investment banks, hedge funds, and private equity firms shows students how firms simultaneously compete and cooperate. The author has captured the ways these firms are reinventing themselves in the post-crash regulatory environment and, through ten extensive cases, the ways in which they are increasing their power and influence.

Emphasizes the needs for capital, sources of capital, and the process of getting capital to those who need it.
Integrates into the chapters ten cases about recent transactions, along with case notes and questions
Accompanies cases with spreadsheets for readers to create their own analytical frameworks and consider choices and opportunities.