Difference between revisions of "C generic track"
(Created page with "The C generic track is concerned with the monitoring of C programs. A benchmark will consist of a C program and a specification (see the rules document). Please follow the ex...") |
|||
| Line 17: | Line 17: | ||
The ExampleName tool works by magic dust and hope, utilising a new constant time algorithm for sorting. This paragraph is an example of the fact that there should be a few sentences written about the team and its tool. The tool is developed by John Lennon and Tintin. Further information about the tool can be found at [http://www.ficticiousAddress.com]. | The ExampleName tool works by magic dust and hope, utilising a new constant time algorithm for sorting. This paragraph is an example of the fact that there should be a few sentences written about the team and its tool. The tool is developed by John Lennon and Tintin. Further information about the tool can be found at [http://www.ficticiousAddress.com]. | ||
| − | * [[ C generic | + | * [[ C generic Team0 Benchmark1 | Benchmark 1 ]] |
Revision as of 23:27, 23 April 2016
The C generic track is concerned with the monitoring of C programs. A benchmark will consist of a C program and a specification (see the rules document).
Please follow the example of Team 0 in how to organise your submission i.e. provide a team name and description and create a page per benchmark (named Track TeamX BenchmarkX).
Please use the below template to create your benchmark Wiki pages. Do not modify the template.
Benchmark Template - C generic track
Team 0 (ExampleName)
The ExampleName tool works by magic dust and hope, utilising a new constant time algorithm for sorting. This paragraph is an example of the fact that there should be a few sentences written about the team and its tool. The tool is developed by John Lennon and Tintin. Further information about the tool can be found at [1].
