Skip to main content

Algorithms in a Nutshell

The following are some of the the chapters from Algorithm's in a Nutshell, from which I will produce code in .NET, specifically C#, VB.NET or F#, to clarify the principles for myself.


Chapter 4. Sorting Algorithms

·       Section 4.1. Overview
·       Section 4.2. Insertion Sort
·       Section 4.3. Median Sort
·       Section 4.4. Quicksort
·       Section 4.5. Selection Sort
·       Section 4.6. Heap Sort
·       Section 4.7. Counting Sort
·       Section 4.8. Bucket Sort
·       Section 4.9. Criteria for Choosing a Sorting Algorithm
·       Section 4.10. References

Chapter 5. Searching

·       Section 5.1. Overview
·       Section 5.2. Sequential Search
·       Section 5.3. Binary Search
·       Section 5.4. Hash-based Search
·       Section 5.5. Binary Tree Search

Chapter 6. Graph Algorithms

·       Section 6.1. Overview
·       Section 6.2. Depth-First Search
·       Section 6.3. Breadth-First Search
·       Section 6.4. Single-Source Shortest Path
·       Section 6.5. All Pairs Shortest Path
·       Section 6.6. Minimum Spanning Tree Algorithms
·       Section 6.7. References

Chapter 7. Path Finding in AI

·       Section 7.1. Overview
·       Section 7.2. Depth-First Search
·       Section 7.3. Breadth-First Search
·       Section 7.4. A*Search
·       Section 7.5. Comparison
·       Section 7.6. Minimax
·       Section 7.7. NegMax
·       Section 7.8. AlphaBeta
·       Section 7.9. References

Chapter 8. Network Flow Algorithms

·       Section 8.1. Overview
·       Section 8.2. Maximum Flow
·       Section 8.3. Bipartite Matching
·       Section 8.4. Reflections on Augmenting Paths
·       Section 8.5. Minimum Cost Flow
·       Section 8.6. Transshipment
·       Section 8.7. Transportation
·       Section 8.8. Assignment
·       Section 8.9. Linear Programming
·       Section 8.10. References

Chapter 9. Computational Geometry

·       Section 9.1. Overview
·       Section 9.2. Convex Hull Scan
·       Section 9.3. LineSweep
·       Section 9.4. Nearest Neighbor Queries
·       Section 9.5. Range Queries
·       Section 9.6. References
Labels:

Comments

Post a Comment

Popular posts from this blog

Heap Sort

Heap Sort is interesting because the use of the 'heapify' method that creates a binary tree as a flat array. First, a binary tree, also known as a heap , is created, and then the same function is used to sort the elements. In a heap, the first node in the array at zero (0) is the top node of the binary tree. The next two (2) items are the two (2) subnodes of the top node, and so on.  For each node at a position (positionIndex), its 2 subnodes are in the following positions: int left = 2 * positionIndex + 1; int right = 2 *  positionIndex + 2; The CommonMethods.Swap() function is a reusable class , since swapping values by position is a common action during these example sorts. Class using System; namespace Algorithms {     class HeapSort     {         public int[]  Sort()         {             //creates array             int[] arrayTo...
6 comments
Read more

Complexity: A Guided Tour

Complexity: A Guided Tour by Melanie Mitchell My rating: 4 of 5 stars I enjoy reading in systems and complexity, and this was a nice addition to my shelf, with a slightly different take than other books. I found a few areas in the first half a bit tedious, overly long, repetitive, and not illuminating, but generally, it's a great overview of seminal work and very thought-provoking. The first half overlaps but nicely differs from other books I've read, covering things like chaos and information processing, and the latter half of the book I found more engaging, focused on models, computation, network science, and scaling. As mentioned, although I found the first half a bit of a slog at times, the second half was very engaging. View all my reviews
Post a Comment
Read more

Review - TFS/VSTS - Great Product, Ideal for Small Development Shops

This is a report a short review I provided for G2 regarding TFS : What do you like best? If you use Visual Studio for development, TFS, or its online equivalent VSTS, you can have a fairly seamless end-to-end integration. Out of the box, it provides code management, testing, work hierarchy in agile formats, automated build, and deployment. What do you dislike? Branching and merging can be a bit painful, in that it needs to be planned, and is not natively part of the process. Code review also needs to be planned and only recently has it become part of the process. Recommendations to others considering the product My only concern regarding TFS and VSTS is that Microsoft itself recommends using Git. What business problems are you solving with the product? What benefits have you realized? In my current role, I've joined a shop that has application development as secondary to their role of desktop OS and app deployment/maintenance, so their code management practi...
Post a Comment
Read more