Algorithms, 4/e (Deluxe): Book and 24-Part Lecture Series (美國原版)

**Included in this Bundle**

THE PRINT BOOK: This fourth edition of Robert Sedgewick and Kevin Wayne’s Algorithms is one of the most popular textbooks on algorithms today and is widely used in colleges and universities worldwide. The algorithms in this book — including 50 algorithms every programmer should know — represent a body of knowledge developed over the last 50 years that has become indispensable, not just for professional programmers and computer science students but for any student with interests in science, mathematics, and engineering and for students who use computation in the liberal arts. In this edition, new Java implementations are written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use.

THE LECTURE SERIES: There are 24 lecture videos that will be streamed on the Informit.com site; each lecture is approximately 60 to 75 minutes in length and focuses on a specific topic related to the Algorithms book. The lecture videos introduce viewers to fundamental data types, algorithms, and data structures, with emphasis on applications and scientific performance analysis of Java implementations. They also cover graph-processing algorithms, including minimum spanning tree and shortest paths algorithms, and string processing algorithms, including string sorts, tries, substring search, regular expressions, and data compression, and concludes with an overview placing the contents of the course in a larger context.

The first 12 lecture videos cover elementary data structures, sorting, and searching. Topics covered in these videos include union-find, binary search, stacks, queues, bags, insertion sort, selection sort, shellsort, quicksort, 3-way quicksort, mergesort, heapsort, binary heaps, binary search trees, red-black trees, separate chaining and linear probing hash tables, Graham scan, and id-trees. Lecture videos 13 through 24 focus on graph and string-processing algorithms. Topics covered in these lecture videos include depth-first search, breadth-first search, topological sort, Kosaraju-Sharir, Kruskal, Prim, Dijkistra, Bellman-Ford, Ford-Fulkerson, LSD radix sort, MSD radix sort, 3-way radix quicksort, multiway tries, ternary search tries, Knuth-Morris-Pratt, Boyer-Moore, Rabin-Karp, regular expression matching, run-length coding, Huffman coding, LZW compression, and the Burrows-Wheeler transform.

Used books, rentals, and purchases made outside of Pearson

If purchasing or renting from companies other than Pearson, the access code for the Video Lectures may not be included, may be incorrect, or may be previously redeemed. Check with the seller before completing your purchase.

**包含在這個套裝中的內容**

印刷書籍：這本由Robert Sedgewick和Kevin Wayne合著的《演算法》第四版是當今最受歡迎的演算法教科書之一，被廣泛使用於全球的大學和學院。本書中的演算法，包括每位程式設計師應該熟悉的50個演算法，代表了過去50年來發展出的不可或缺的知識，不僅對於專業程式設計師和計算機科學學生，也對於對科學、數學、工程有興趣的學生以及在文科領域使用計算的學生來說都是必備的。在這個版本中，新的Java實現以易於理解的模塊化編程風格撰寫，所有的程式碼都對讀者公開並可立即使用。

講座系列：共有24個講座視頻將在Informit.com網站上進行串流播放；每個講座長度約為60至75分鐘，重點介紹與《演算法》書籍相關的特定主題。這些講座視頻向觀眾介紹基本的資料類型、演算法和資料結構，強調Java實現的應用和科學性能分析。它們還涵蓋了圖形處理演算法，包括最小生成樹和最短路徑演算法，以及字符串處理演算法，包括字符串排序、字串搜尋、正則表達式和資料壓縮，最後總結了將課程內容放入更大背景的概述。

前12個講座視頻涵蓋了基本的資料結構、排序和搜尋。這些視頻涵蓋的主題包括連接-查找、二分搜尋、堆疊、佇列、袋子、插入排序、選擇排序、希爾排序、快速排序、三向快速排序、合併排序、堆排序、二元堆、二分搜尋樹、紅黑樹、分離鏈接和線性探測哈希表、Graham掃描和id樹。第13至24個講座視頻專注於圖形和字符串處理演算法。這些講座視頻涵蓋的主題包括深度優先搜尋、廣度優先搜尋、拓撲排序、Kosaraju-Sharir、Kruskal、Prim、Dijkistra、Bellman-Ford、Ford-Fulkerson、LSD基數排序、MSD基數排序、三向基數快速排序、多路字典樹、三分搜尋字典樹、Knuth-Morris-Pratt、Boyer-Moore、Rabin-Karp、正則表達式匹配、運行長度編碼、Huffman編碼、LZW壓縮和Burrows-Wheeler轉換。

**關於Pearson以外的二手書、租借和購買**

如果從Pearson以外的公司購買或租借，視頻講座的存取代碼可能不包含在內，可能不正確，或者可能已被使用。在完成購買之前，請與賣家確認。