modtimetest2.frink

Download or view modtimetest2.frink in plain text format


// Timing test for modular exponentiation

println["M\tOps/sec"]

// This outer loop is to minimize effects of the Java VM doing bytecode
// compiling on the first run.
for loop = 1 to 10
{
   for M = 10 bytes to 100 bytes step 10 bytes
   {
      modulus = 256^(M/byte)

      limit = 1000

      start = now[]
      for i = 1 to limit
      {
         base = randomBits[M/bit]
         exponent = randomBits[M/bit]
         result = modPow[base, exponent, modulus]
      }

      end = now[]

      println[(M -> bytes) + "\t" + format[limit / (end-start), s^-1, 2]]
   }

   println[""]
}

Download or view modtimetest2.frink in plain text format

This is a program written in the programming language Frink.
For more information, view the Frink Documentation or see More Sample Frink Programs.

Alan Eliasen was born 20139 days, 6 hours, 33 minutes ago.