Syndetics cover image
Image from Syndetics

Algorithms / Robert Sedgewick and Kevin Wayne.

By: Contributor(s): Material type: TextPublication details: Upper Saddle River, NJ : Addison-Wesley, cop. 2011Edition: 4. edDescription: xii, 955 s. : ill. ; 24 cmISBN:
  • 9780321573513
  • 0-321-57351-X
Subject(s): DDC classification:
  • 005.1 22
Incomplete contents:
Preface ; Chapter 1: Fundamentals ; 1.1 Basic Programming Model ; 1.2 Data Abstraction ; 1.3 Bags, Queues, and Stacks ; 1.4 Analysis of Algorithms ; 1.5 Case Study: Union-Find ; Chapter 2: Sorting ; 2.1 Elementary Sorts ; 2.2 Mergesort ; 2.3 Quicksort ; 2.4 Priority Queues ; 2.5 Applications ; Chapter 3: Searching ; 3.1 Symbol Tables ; 3.2 Binary Search Trees ; 3.3 Balanced Search Trees ; 3.4 Hash Tables ; 3.5 Applications ; Chapter 4: Graphs ; 4.1 Undirected Graphs ; 4.2 Directed Graphs ; 4.3 Minimum Spanning Trees ; 4.4 Shortest Paths ; Chapter 5: Strings ; 5.1 String Sorts ; 5.2 Tries ; 5.3 Substring Search ; 5.4 Regular Expressions ; 5.5 Data Compression ; Chapter 6: Context ; Index ; List of Algorithms ; List of Clients
Summary: This fourth edition of Robert Sedgewick and Kevin Wayne's Algorithms is the leading textbook on algorithms today and is widely used in colleges and universities worldwide. This book surveys the most important computer algorithms currently in use and provides a full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing -- including fifty algorithms every programmer should know. 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 algorithms in this book 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, not to mention students who use computation in the liberal arts.
Holdings
Cover image Item type Current library Home library Collection Shelving location Call number Materials specified Vol info URL Copy number Status Notes Date due Barcode Item holds Item hold queue priority Course reserves
Bok Orkanenbiblioteket 000-099 005.1 sed Checked out 2026-06-22 3204231921
Bok Orkanenbiblioteket 000-099 005.1 sed Checked out 2026-06-18 320423194X
Bok Orkanenbiblioteket 000-099 005.1 sed EJ HEMLÅN 3204231930
Bok Orkanenbiblioteket 000-099 005.1 sed Available 3204231959
Total holds: 0

Includes index.

Preface ; Chapter 1: Fundamentals ; 1.1 Basic Programming Model ; 1.2 Data Abstraction ; 1.3 Bags, Queues, and Stacks ; 1.4 Analysis of Algorithms ; 1.5 Case Study: Union-Find ; Chapter 2: Sorting ; 2.1 Elementary Sorts ; 2.2 Mergesort ; 2.3 Quicksort ; 2.4 Priority Queues ; 2.5 Applications ; Chapter 3: Searching ; 3.1 Symbol Tables ; 3.2 Binary Search Trees ; 3.3 Balanced Search Trees ; 3.4 Hash Tables ; 3.5 Applications ; Chapter 4: Graphs ; 4.1 Undirected Graphs ; 4.2 Directed Graphs ; 4.3 Minimum Spanning Trees ; 4.4 Shortest Paths ; Chapter 5: Strings ; 5.1 String Sorts ; 5.2 Tries ; 5.3 Substring Search ; 5.4 Regular Expressions ; 5.5 Data Compression ; Chapter 6: Context ; Index ; List of Algorithms ; List of Clients

This fourth edition of Robert Sedgewick and Kevin Wayne's Algorithms is the leading textbook on algorithms today and is widely used in colleges and universities worldwide. This book surveys the most important computer algorithms currently in use and provides a full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing -- including fifty algorithms every programmer should know. 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 algorithms in this book 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, not to mention students who use computation in the liberal arts.