| ²é¿´: 359 | »Ø¸´: 2 | ||
| ¡¾½±Àø¡¿ ±¾Ìû±»ÆÀ¼Û2´Î£¬×÷Õßzyz1981Ôö¼Ó½ð±Ò 1 ¸ö | ||
| µ±Ç°Ö÷ÌâÒѾ´æµµ¡£ | ||
zyz1981ÖÁ×ðľ³æ (ÎÄ̳¾«Ó¢)
|
[×ÊÔ´]
¡¾·ÖÏí¡¿An introduction to the Analysis of Algorithms
|
|
|
ÖÐÎÄÃû: Ëã·¨·ÖÎöµ¼ÂÛ ÔÃû: An introduction to the Analysis of Algorithms ×÷Õß: Robert Sedgewick Philippe FlajoletͼÊé·ÖÀà: ¼ÆËã»úÓëÍøÂç ×ÊÔ´¸ñʽ: DJVU °æ±¾: Ó¢ÎÄ°æ ³ö°æÉç: »úе¹¤Òµ³ö°æÉçÊéºÅ: 9787111186069·¢ÐÐʱ¼ä: 2006Äê µØÇø: ´ó½ ÓïÑÔ: Ó¢ÎÄ ¼ò½é: Ëã·¨·ÖÎöµ¼ÂÛ Robert Sedgewick £» Philippe Flajolet »ù±¾ÐÅÏ¢ ¡¤³ö°æÉ磺»úе¹¤Òµ³ö°æÉç ¡¤Ò³Â룺492 Ò³ ¡¤³ö°æÈÕÆÚ£º2006Äê04Ô ¡¤ISBN£º7111186060 ¡¤ÌõÐÎÂ룺9787111186069 ¡¤°ü×°°æ±¾£º2006-04-01 ¡¤×°Ö¡£ºÆ½×° ¡¤¿ª±¾£º16¿ª ¡¤´ÔÊéÃû£º¾µäÔ°æÊé¿â ɨÃè·Ö±æÂÊ£º600 dpi; 508 Scans djvu µç×ÓÊéÔĶÁÆ÷£º http://windjview.sourceforge.net/ ÄÚÈݼò½é ¡¡¡¡±¾ÊéΪȫӢÎÄ¡£ËüÈ«Ãæ½éÉÜÁËËã·¨µÄÊýѧ·ÖÎöÖÐʹÓõĻù±¾·½·¨£¬ËùÉæ¼°µÄÄÚÈÝÀ´×Ô¾µäµÄÊýÑ§ËØ²Ä(°üÀ¨ÀëÉ¢Êýѧ¡¢³õµÈʵ·ÖÎö¡¢×éºÏÊýѧ)£¬ÒÔ¼°¾µäµÄ¼ÆËã»ú¿ÆÑ§ËزÄ(°üÀ¨Ëã·¨ºÍÊý¾Ý½á¹¹)¡£ËäÈ»ÊéÖÐÂÛÊöÁË¡°×ÇéÐΡ±ºÍ¡°¸´ÔÓÐÔÎÊÌ⡱·ÖÎöËùÐèµÄ»ù±¾Êýѧ¹¤¾ß£¬µ«ÊÇÖØµã»¹ÊÇÌÖÂÛ¡°Æ½¾ùÇéÐΡ±»ò¡°¸ÅÂÊ¡±·ÖÎö¡£ÂÛÌâÉæ¼°µÝ¹é¡¢Éú³Éº¯Êý¡¢½¥½üÐÔ¡¢Ê÷¡¢´®¡¢Ó³ÉäµÈÄÚÈÝ£¬ÒÔ¼°¶ÔÅÅÐò¡¢Ê÷²éÕÒ¡¢´®²éÕÒºÍÉ¢ÁÐÖîËã·¨µÄ·ÖÎö¡£ ¡¡¡¡±¾ÊéÈ«Ãæ½éÉÜÁËËã·¨µÄÊýѧ·ÖÎöÖÐʹÓõĻù±¾·½·¨£¬ËùÉæ¼°µÄÄÚÈÝÀ´×Ô¾µäµÄÊýÑ§ËØ²Ä(°üÀ¨ÀëÉ¢Êýѧ¡¢³õµÈʵ·ÖÎö¡¢×éºÏÊýѧ)£¬ÒÔ¼°¾µäµÄ¼ÆËã»ú¿ÆÑ§ËØ²Ä (°üÀ¨Ëã·¨ºÍÊý¾Ý½á¹¹)¡£ËäÈ»ÊéÖÐÂÛÊöÁË¡°×ÇéÐΡ±ºÍ¡°¸´ÔÓÐÔÎÊÌ⡱·ÖÎöËùÐèµÄ»ù±¾Êýѧ¹¤¾ß£¬µ«ÊÇÖØµã»¹ÊÇÌÖÂÛ¡°Æ½¾ùÇéÐΡ±»ò¡°¸ÅÂÊ¡±·ÖÎö¡£ÂÛÌâÉæ¼°µÝ¹é¡¢Éú³Éº¯Êý¡¢½¥½üÐÔ¡¢Ê÷¡¢´®¡¢Ó³ÉäµÈÄÚÈÝ£¬ÒÔ¼°¶ÔÅÅÐò¡¢Ê÷²éÕÒ¡¢´®²éÕÒºÍÉ¢ÁÐÖîËã·¨µÄ·ÖÎö¡£ ¡¡¡¡¾¡¹ÜÈËÃǼ«Îª¹Ø×¢Ëã·¨µÄÊýѧ·ÖÎö£¬µ«Êǹ㷺ʹÓõķ½·¨ºÍÄ£ÐÍ·½ÃæµÄ»ù±¾ÐÅÏ¢Éв»ÄÜΪ¸ÃÁìÓòµÄ¹¤×÷ºÍÑо¿ËùÖ±½ÓʹÓá£×÷ÕßÔÚ±¾ÊéÖд¦ÀíÕâÖÖÐèÇ󣬰ѸÃÁìÓò³öÏÖµÄÌôÕ½ÒÔ¼°Îª¸úÉÏеÄÑо¿ÒÔÓ½ÓÕâЩÌôÕ½Ëù±ØÐèµÄ±³¾°×ÊÁÏÍêÃÀµØ½áºÏÔÚÒ»Æð¡£ Ŀ¼: TABLE OF CONTENTS CHAPTER ONE: ANALYSIS OF ALGORITHMS 1.1 Why Analyze an Algorithm? 1.2 Computational Complexity 1.3 Analysis of Algorithms 1.4 Average-Case Analysis 1.5 Example: Analysis of Quieksort 1.6 Asymptotic Approximations 1.7 Distributions 1.8 Probabilistic Algorithms CHAPTER TWO: RECURRENCE RELATIONS 2.1 Basic Properties 2.2 First-Order Recurrences 2.3 Nonlinear First-Order Recurrences 2.4 Higher-Order Recurrences 2.5 Methods for Solving Recurrences 2.6 Binary Divide-and-Conquer Recurrences and Binary Numbers 2.7 General Divide-and-Conquer Recurrences CHAPTER THREE: GENERATING FUNCTIONS 3.1 Ordinary Generating Functions 3.2 Exponential Generating Functions 3.3 Generating Function Solution of Recurrences 3.4 Expanding Generating Functions 3.5 Transformations with Generating Functions 3.6 Functional Equations on Generating Functions 3.7 Solving the Quicksort Median-of-Three Recurrence with OGFs 3.8 Counting with Generating Functions 3.9 The Symbolic Method 3.10 Lagrange Inversion 3.11 Probability Generating Functions 3.12 Bivariate Generating Functions 3.13 Special Functions CHAPTER FOUR: ASYMPTOTIC APPROXIMATIONS 4.1 Notation for Asymptotic Approximations 4.2 Asymptotic Expansions 4.3 Manipulating Asymptotic Expansions 4.4 Asymptotic Approximations of Finite Sums 4.5 Euler-Maclaurin Summation 4.6 Bivariate Asymptotics 4.7 Laplace Method 4.8 "Normal" Examples from the Analysis of Algorithms 4.9 "Poisson" Examples from the Analysis of Algorithms 4.10 Generating Function Asymptotics CHAPTER FIVE: TREES 5.1 Binary Trees 5.2 Trees and Forests 5.3 Properties of Trees 5.4 Tree Algorithms 5.5 Binary Search Trees 5.6 Average Path Length in Catalan Trees 5.7 Path Length in Binary Search Trees 5.8 Additive Parameters of Random Trees 5.9 Height 5.10 Summary of Average-Case Results on Properties of Trees 5.11 Representations of Trees and Binary Trees 5.12 Unordered Trees 5.13 Labelled Trees 5.14 Other Types of Trees CHAPTER SIX: PERMUTATIONS 6.2 Algorithms on Permutations 6.3 Representations of Permutations 6.4 Enumeration Problems 6.5 Analyzing Properties of Permutations with CGFs 6.6 Inversions and Insertion Sorts 6.7 Left-to-Right Minima and Selection Sort 6.8 Cycles and In Situ Permutation 6.9 Extremal Parameters CHAPTER SEVEN: STRINGS AND TRIES 7.1 String Searching 7.2 Combinatorial Properties of Bitstrings 7.3 Regular Expressions 7.4 Finite-State Automata and the Knuth-Morris-Pratt Algorithm 7.5 Context-Free Grammars 7.6 Tries 7.7 ride Algorithms 7.8 Combinatorial Properties of Tries 7.9 Larger Alphabets CHAPTER EIGHT: WORDS AND MAPS 8.1 Hashing with Separate Chaining 8.2 Basic Properties of Words 8.3 Birthday Paradox and Coupon Collector Problem 8.4 Occupancy Restrictions and Extremal Parameters 8.5 Occupancy Distributions 8.6 Open Addressing Hashing 8.7 Maps 8.8 Integer Factorization and Maps List of Theorems Index ÏÂÔØµØÖ·£º http://www.verycd.com/topics/2779678/ |
» ²ÂÄãϲ»¶
310Çóµ÷¼Á
ÒѾÓÐ12È˻ظ´
290Çóµ÷¼Á
ÒѾÓÐ7È˻ظ´
µçÆø×¨Ë¶320Çóµ÷¼Á
ÒѾÓÐ5È˻ظ´
Ò»Ö¾Ô¸Î÷±±¹¤Òµ´óѧ289 085602
ÒѾÓÐ33È˻ظ´
Ò»Ö¾Ô¸¹þ¹¤´ó 085600 277 12²Ä¿Æ»ùÇóµ÷¼Á
ÒѾÓÐ24È˻ظ´
268·Ö085602»¯Ñ§¹¤³Ìµ÷¼Á
ÒѾÓÐ28È˻ظ´
»¯Ñ§¹¤³Ìµ÷¼Á289
ÒѾÓÐ50È˻ظ´
Çóµ÷¼Á£¬262»úеר˶
ÒѾÓÐ8È˻ظ´
305Çóµ÷¼Á
ÒѾÓÐ6È˻ظ´
327Çóµ÷¼Á
ÒѾÓÐ5È˻ظ´
2Â¥2009-11-09 08:29:54
haixing2008
ÈÙÓþ°æÖ÷ (ÎÄ̳¾«Ó¢)
- Ó¦Öú: 22 (СѧÉú)
- ¹ó±ö: 2.252
- ½ð±Ò: 32603.8
- Ìû×Ó: 25068
- ÔÚÏß: 429.1Сʱ
- ³æºÅ: 540264
3Â¥2009-12-15 10:19:23













»Ø¸´´ËÂ¥
5