Tools
- S1L0_MinGW <> Introduction to the MinGW interface, with installation instructions
- S1L1_new <> Write the first program to test the use of make, the editor, and the MinGW installation.
- S1L2_struct <> Structures make your life simpler, this lesson shows you some examples
- S1L3_linked <> Structures can make data nodes, which can be linked together for flexible, extensible lists and more complex data structures
- S1L4_sort <> Sorting data is a necessary skill, this lesson is just the beginning
- S1L5_sortlink <> Now that you can sort arrays, it is time to see how to sort linked lists
- S1L6_tree <> Imagine you have a constant stream of data to log. You need to keep it sorted at all times. Building a tree is the simple way of doing this.
- S1L7_search <> When you have a file of data, you want to know what is in it. Finding data is a varied problem. It all depends on how the data is stored. Is it sorted alphabetically or numerically? If so, you can use the binary search algorithm described in this lesson
- S1L8_string <> Strings of characters can use the same algorithms as more complex data structures. There are many tools built in to C and C++ to find characters, build strings, find substrings of characters, convert to upper or lower case, and a variety of others. This lesson loads a few text files from the Gutenberg Project then applies these tools
- S1LFP database <> I realized a good capstone project for this section of lessons was a keypad driven database. I wrote this lesson in a journal fashion, with snapshots of the code as it developed. There are many pages of notes on how to extend this code into a relational database system.
- Section one lessons zipped