SedgewickWayne.Algorithms

Porting algorithms by Robert Sedgewick and Kevin Wayne in .NET.

This repository contains .NET implementations of data structures and algorithms as lectured by Robert Sedgewick and Kevin Wayne in the Princeton course.
No copyright breaches, porting to .NET is a personal endeavour via publicly available Java source code.
In addition to that, I am introducing abstractions not present in the original source.

Pages

work for which porting was finished and unit tests passing.
links for documentation pages

Below links to documentation pages for different algorithm categories.
These map to sections of the Princeton course website.
Each page below should contain references to java source and ported .NET implementations, class diagrams, implementation details.

• Fundamentals
• Collections
• Dynamic Connectivity
• Sorting
• Priority Queues
• Symbol tables. Currently in progress.
• Minimum Spanning Trees Currently in progress.
• Todo

Resources

• book Algorithms FOURTH EDITION Robert Sedgewick and Kevin Wayne Princeton University.
  Addison-Wesley. Copyright © 2011 Pearson Education, Inc.
• lectures, java source code, notes and slides on course website
• algs4.jar algs4 java archive.
• IKVM vs porting

table of contents

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
2. Sorting
   2.1 Elementary Sorts
   2.2 Mergesort
   2.3 Quicksort
   2.4 Priority Queues
   2.5 Applications
3. Searching
   3.1 Symbol Tables
   3.2 Binary Search Trees
   3.3 Balanced Search Trees
   3.4 Hash Tables
   3.5 Applications
4. Graphs
   4.1 Undirected Graphs
   4.2 Directed Graphs
   4.3 Minimum Spanning Trees
   4.4 Shortest Paths
5. Strings
   5.1 String Sorts
   5.2 Tries
   5.3 Substring Search
   5.4 Regular Expressions
   5.5 Data Compression