Crossbones+ - Reputation: 9578
Posted 29 March 2012 - 07:37 PM
The slowsort algorithm is a perfect illustration of the multiply and surrender paradigm, which is perhaps the single most important paradigm in the development of reluctant algorithms. The basic multiply and surrender strategy consists in replacing the problem at hand by two or more subproblems, each slightly simpler than the original, and continue multiplying subproblems and subsubproblems recursively in this fashion as long as possible. At some point the subproblems will all become so simple that their solution can no longer be postponed, and we will have to surrender. Experience shows that, in most cases, by the time this point is reached the total work will be substantially higher than what could have been wasted by a more direct approach.
- Pessimal Algorithms and Simplexity Analysis
Members - Reputation: 1629
Posted 30 March 2012 - 01:33 AM
When you say "draw a wireframe cube", we really don't know what have you already learnt. Can you change your camera? Can you rotate the cube? Could you do something else than a cube if you wanted? Could you render a shaded (not wireframe) cube? Can you do lighting? Texturing? .... .... ....