Riassunto
<p style="margin:0px;"> **Included in this Bundle**</p> <p style="margin:0px;"> </p> <p style="margin:0px;">THE PRINT BOOK: This fourth edition of Robert Sedgewick and Kevin Wayne’s <b>Algorithms </b>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.</p> <p style="margin:0px;"> </p> <p style="margin:0px;">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.</p> <p style="margin:0px;">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.</p> <p style="margin:0px;"><br></p> <p style="margin:0px;"><b>Used books, rentals, and purchases made outside of Pearson</b></p> <p style="margin:0px;">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.</p>
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
