Algorithms to compute the M-th lexicographic ordering of a permutation or combination and the inverse problem of the rank of a given permutation or sequence.
Latest Searching Articles
Once you commit your data structures to a graph representation with the Boost Graph Library, the possibilities of sorting, searching, and connecting networks are limitless.
Search a string in a big array of string pointers using a simple binary tree search method.
Latest CodeGuru Developer Columns
A pointer-to-member represents a location inside a class; selecting a member means offsetting into it. Explore this intricate idea. With examples.
Read through various ways to license and protect your .NET applications from potential pirates. You may find the perfect choice for your own work.
Explore two ways to check whether an application is already running. Example code is both in C# and VB.NET.
Discover the world of Portable Class Libraries (PCLs) and how they can work for you.