MaxCoderz

threefingeredguy wrote:Or you could test them on an 84+ and read in the current clock time, then run the program, then read in the cloc time at the end.

I doubt any one here wrote routine that would take a second at all. Cobb stupid sort would be pretty slow but with memory restrictions I doubt that would do it. To better test it I think maybe having it run the same array(s) repeatedly 1000 times you would be able to test it with a stop watch.

Then again how bout another competiton.

Let us wait a little till the summer breaks are away... like end of sept.

So what about a new contest now.

Yeah, I'm in again.

Any ideas?

Line routine.
Swap mem routine.
Sprite routine.
Cool Graphical Demos.

A basic contest .

Encryption algorithm
Compression algorithm

Someone in my school (I found another z80 progger!!!!!) wrote TI83+ compression algorithms for a science fair project.

Create a computational problem or borrow one from a simple programming competition from somewhere. Let people solve the problem using any way they want (language doesn't matter for instance).

Winner can be awarded to he (she?) who solves the problem; if that is not enough, then select the one who has the most efficient algorithm considering the language of choice. If the efficiency can't be measured or otherwise easily compared, a pure performance test will decide the ultimate winner, thus asm would a good choice for performance, but Basic can be much easier for designing a clever solution.

Example: Let a graph define directed paths from various cities (directional airlines for instance). The solver should be able to find the shortest route from any city to another, never going the wrong direction on a path. Two-way paths may exist by having two one-way paths.
The graph should be easily interchangeable so that the judges can use any input to test the solvers to prevent any hardcoding of specific data.

I would enter if I didn't know a good way of doing this in