Under normal circumstances, you can only ask for a bit rotation using assembly code, however, it is possible to imitate rotation through code. First an explanation on rotating, and bits: Bits, make up bytes. When represented in binary, a bit can be either a 1, or a 0. Nothing more. A byte, is a bunch [...]
READ MORE »Monthly archives for November, 2009
Goofy Sort
You know it’s an easy algorithm to program when you’re done writing it, before the teacher is done explaining it… #include "GSort.h" void GSort::sort( int numbers[], int size ) { int i = 0; int previous, current; while( true ) { if( i == 0 ) //No previous, step forward. { i++; continue; } [...]
READ MORE »Moving to WordPress
Hey guys, Mike here. Here’s the deal: I’ve decided to split off my code development of the ShiftedBits framework away from the actual website where I talk about this (as stuff would never get done otherwise) and just move to a wordpress blog, and shove the code into a git repository. I decided to do [...]
READ MORE »