はてなブックマーク

Stanford CS Education Library: A 45 page summary of the C language. Explains all the common features and techniques for the C language. The coverage is pretty quick, so it is most appropriate for someone with some programming background who needs to see how C works. Topics include variables, int types, floating point types, promotion, truncation, operators, control structures (if, while, for), fun

This article introduces the basic concepts of binary trees, and then works through a series of practice problems with solution code in C/C++ and Java. Binary trees have an elegant recursive pointer structure, so they are a good way to learn recursive pointer algorithms. Contents Section 1. Binary Tree Structure -- a quick introduction to binary trees and the code that operates on them Section 2. B

Stanford CS Education Library This online library collects education CS material from Stanford courses and distributes them for free. Update 2006 For learning code concepts (Java strings, loops, arrays, ...), check out Nick's experimental javabat.com server, where you can type in little code puzzles and get immediate feedback. Pointers and Memory -- videos and materials on basic pointers Lists and