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.
The original release of the .NET Framework included collections as .NET was introduced to the Microsoft programming world. The .NET Framework 2.0 introduced generics to complement the System.Collections namespace and provide a more efficient and well performing option. Read on to learn more...
Knowing which version of MS Office is installed on the client computer is vital; unfortunately, many programmers see this as an afterthought. Hannes du Preeze shows you four different ways to determine the Office versions installed so that you don't make this mistake.
A developer building messaging solutions with Azure Queuing and Azure Service Bus should follow a Pipeline pattern when processing a significant number of different messages. One approach to building a Pipeline is to layer a message following an Envelope pattern.
