https://wiki.slashdev.ca/ 2026-04-11T22:59:04+00:00 https://wiki.slashdev.ca/ https://wiki.slashdev.ca/lib/tpl/dokuwiki/images/favicon.ico text/html 2010-05-27T14:02:49+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.slashdev.ca/codeapalooza:challenge_1?rev=1274968969&do=diff Quote " Bill McKie pointed out that x86/OSX wasn't trapping overflows during real exponentiation. It turns out that OSX uses the MMX unit to do exponentiation instead of the x87. So I added code to set the bits for MMX traps. Not only does the MMX exponentiation use about six times the text/html 2010-05-27T14:03:37+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.slashdev.ca/codeapalooza:challenge_2?rev=1274969017&do=diff Quote “To iterate is human, to recurse is devine” - Andrew Koenig The Challenge Challenge number two is as follows: Draw a tree at runtime. You can do this however you like, but the following restrictions apply: - no viewable images/textures (except those you make at runtime, if any) - no hardcoded coord values (this applies to the above, no arrays of rgb values, make them using an algo if you want) text/html 2010-05-27T14:04:02+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.slashdev.ca/codeapalooza:challenge_3?rev=1274969042&do=diff Problem Given two log files, containing one log entry per line, generate lists IP addresses unique to each file. (IP's in file1.log but not in file2.log and IP's in file2.log but not in file1.log) Sample Data Use the following to verify results: text/html 2010-05-27T14:04:23+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.slashdev.ca/codeapalooza:challenge_4?rev=1274969063&do=diff Problem `Implement a mathematical expression evaluator` Basically take a string such as: "(45 - 5) / 10" and find the result. The engine must support basic substitution as well, example: "(width / 2) - offset" Here are the rules: * you CAN NOT use python's eval() function text/html 2010-12-10T15:43:34+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.slashdev.ca/codeapalooza:challenge_5?rev=1291995814&do=diff The Challenge You are given 2 random, valid points (start, end) and a random terrain map. You must find the shortest distance between the two starting points without going through any out-of-bounds terrain. This is a path finding algorithm challenge. The success of your efforts will be based upon how fast your algorithm can discover the quickest path. text/html 2010-11-27T16:00:38+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.slashdev.ca/codeapalooza:start?rev=1290873638&do=diff Codeapalooza Challenges * Challenge 1 - combinations of coordinate pairs * Challenge 2 - draw a tree * Challenge 3 - log file compare * Challenge 4 - mathematical expression evaluator * Challenge 5 - path finding routine