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.
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.
The Transactional File System (TxF), which allows access to an NTFS file system to be conducted in a transacted manner through extensions to the Windows SDK API. MFC 10, has been extended to support TxF and related technologies. This support allows existing MFC applications to be easily extended to support kernel transactions.
Learn to create URLs for webforms that are page-independent.
Learn how to make your own usable .NET Component with Visual Basic.
.
Arun Karthick introduces you to the state machine model and shows you how to create a simple working state machine sample using the .NET framework in the C# language.
