Let's make a list of training programs

object oriented languages - a polynomial class with a rational class that makes use of both a template linked list and template stack class that accepts a list of terms

A program that uses recurssion to calculate pi which has an upper bounds of O(n log n)

Query language, just use your imagination

>>1
template
I don't even know what that's supposed to mean in this context. Why do you say ``object oriented'' when you presumably mean ``Sepples''?

A quine that doesn't read its own source.

polynomial class...lulz

>>1
upper bounds of O(n log n)
Space? Time? Which n? Just go away.

>>3
Quines don't by definition.

bigint library.

>>1
Go away.

11 Name: Anonymous 2011-01-31 19:55

<-- check em dubz