Michael Abrash's classic Graphics Programming Black Book is a compilation of Michael's writings on assembly language and graphics programming (including from his "Graphics Programming" column in Dr. Dobb's Journal
Want to write shorter, cleaner code? Have an unfortunate situation where you need to fit as much as you can in one expression? Prefer a quick dose of hacks to spending the rest of your life reading the docs? You've come to the right place.
ou never know when a good cheat sheet will come in handy -- bookmark this page to keep our treasure trove of useful information at your fingertips! Looking for more in-depth information? Check out our Learning Guides and Tutorials.
This is a collection of Erlang example programs. The document is also available as a postscript or pdf file. All the programs referred to are available in the archive examples-2.0.tgz. The programs attempt to do useful things, thus you will find complete
My first experience with software quality was in 1976, when I sat in front of an ASR-33 and laboriously typed 2 pages of BASIC code from David Ahl's "Creative Computing" into my high school's Hewlett-Packard 21MX. Supposedly it would let me simulate a lun
Dijkstra's algorithm is probably the best-known and thus most implemented shortest path algorithm. It is simple, easy to understand and implement, yet impressively efficient. By getting familiar with such a sharp tool, a developer can solve efficiently an
One night five developers, all of whom wore very thick glasses and had recently been hired by Elephants, Inc., the world’s largest purveyor of elephants and elephant supplies, were familiarizing themselves with the company’s order processing system wh
CodeAsDocumentation agile 22 March 2005 One of the common elements of agile methods is that they raise programming to a central role in software development - one much greater than the software engineering community usually does. Part of this is classifyi