var BenchTests = {
"Tests":[
{ "id": "Quicksort", "Name": "Quicksort", "Coeff": 5.16, "Run": function() { return RunQuicksortTest(); }, "Description": "Quicksort
An array, increasing in size with each iteration, is populated with random numbers and quicksorted. This provides a real-world benchmark test of array manipulation.
" },
{ "id": "Factorial", "Name": "Factorials", "Coeff": 0.39, "Run": function() { return RunExpensiveFactorial(); }, "Description": "Factorials
With each iteration, the benchmark calculates i! (factorial) and 2^i (exponent), where i represents the number of iterations completed. This provides a good benchmark of recursion and exponent math, which is typically a CPU-expensive process." },
{ "id": "Conway", "Name": "Conway", "Coeff": 1.68, "Run": function() { return RunConwayTest(); }, "Description": "Conway
Based on Conway’s Game of Life, an 8x8 matrix is generated and randomly populated with alive or dead cells. Each cycle within the game counts as an iteration. This provides a real-world example of a game that has heavy array manipulation.
" },
{ "id": "Ribosome", "Name": "Ribosome", "Coeff": 14.29, "Run": function() { return RunRibosomeTest(); }, "Description": "Ribosome
With each iteration, a “nucleotide chain” of 1,000 base pairs is created and added on to a previous chain. As the chain grows, a random codon (triplet set) of nucleotides is selected to mutate into another random codon. This makes heavy use of regular expressions in a mock-simulation of a biological situation." },
{ "id": "MD5", "Name": "MD5", "Coeff": 291.97, "Run": function() { return RunMD5Test(); }, "Description": "MD5
An MD5 encryption hash is generated from Hamlet’s famous soliloquy. At each iteration, the string changes slightly (to prevent potential unfair caching) and a new MD5 hash is created. This benchmark is extremely representative of real-world encryption hashing scenario.
" },
{ "id": "Primes", "Name": "Primes", "Coeff": 0.21, "Run": function() { return RunPrimesTest(); }, "Description": "Primes
Calculates as many prime numbers as possible within the given time allotment." },
{ "id": "GeneticSalesman", "Name": "Genetic Salesman", "Coeff": 10.12, "Run": function() { return RunGeneticSalesman(); }, "Description": "Genetic Salesman
Uses a genetic algorithm to determine the optimum route between five randomly generated points. Each generation of the genetic algorithm counts as an iteration.
" },
{ "id": "Arrays", "Name": "Arrays", "Coeff": 2.42, "Run": function() { return RunArrayTest(); }, "Description": "Arrays
Classic benchmark test that adds random characters to an expanding array while shifting and pushing elements onto the end of the array. Each iteration ends by sorting and reversing the array." },
{ "id": "Dates", "Name": "Dates", "Coeff": 0.20, "Run": function() { return RunDatesTest(); }, "Description": "Dates
A random date between 1/1/1050 and 12/31/2050 is generated using the Parse() method. This random date is compared against a static date (12/7/1941) and various date-based mathematical expressions are evaluated." },
{ "id": "Exceptions", "Name": "Exceptions", "Coeff": 0.08, "Run": function() { return RunExceptionTest(); }, "Description": "Exceptions
An error is thrown to the browser within a try/catch/finally statement. Error handling is typically an expensive CPU process; catching errors can consume large amounts of CPU time." }
]
}; 
