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.
Discover Code::Blocks, an open source IDE for C/C++.
It's possible that you don't even realise that you have an application that uses plug-ins. Use MEF to tame them.
Use Devextreme and Visual Studio to create a basic mobile app.
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.
