From: <da...@de...> - 2004-02-07 18:09:11
|
Ok, so after some discussions with Salvatore, I think I have an idea of what the next steps should be: *) Finish the lists test:-) Ideas on how to best do this? I think maybe it's easiest to work backwards from what is O(N) for linked list implementations and concentrate on excluding everything else? Maybe the easiest thing is just to create a list and pop stuff off the head, something that would be slow in a vector implementation. Other things that involve an index 'somewhere in the middle' are going to help out the vector implementation... Right? *) Create some other tests, both "Get it done" style tests to show practical things being done, and "Language feature" tests. What could an initial set of these be? * Vectors (feature) * Hash tables/Arrays (feature) * Reverse a file (practical) * Word frequency count (practical) These tests will be done in Tcl and C, and as people have time, can be added in other languages. -- David N. Welton Consulting: http://www.dedasys.com/ Personal: http://www.dedasys.com/davidw/ Free Software: http://www.dedasys.com/freesoftware/ Apache Tcl: http://tcl.apache.org/ |