How to resolve the algorithm Time a function step by step in the E programming language
Published on 12 May 2024 09:40 PM
How to resolve the algorithm Time a function step by step in the E programming language
Table of Contents
Problem Statement
Write a program which uses a timer (with the least granularity available on your system) to time how long a function takes to execute. Whenever possible, use methods which measure only the processing time used by the current process; instead of the difference in system time between start and finish, which could include time used by other processes on the computer. This task is intended as a subtask for Measure relative performance of sorting algorithms implementations.
Let's start with the solution:
Step by Step solution about How to resolve the algorithm Time a function step by step in the E programming language
Source code in the e programming language
def countTo(x) {
println("Counting...")
for _ in 1..x {}
println("Done!")
}
def MX :=
def threadMX := MX.getThreadMXBean()
require(threadMX.isCurrentThreadCpuTimeSupported())
threadMX.setThreadCpuTimeEnabled(true)
for count in [10000, 100000] {
def start := threadMX.getCurrentThreadCpuTime()
countTo(count)
def finish := threadMX.getCurrentThreadCpuTime()
println(`Counting to $count takes ${(finish-start)//1000000}ms`)
}
You may also check:How to resolve the algorithm Continued fraction step by step in the XPL0 programming language
You may also check:How to resolve the algorithm Statistics/Normal distribution step by step in the VBA programming language
You may also check:How to resolve the algorithm Accumulator factory step by step in the FreeBASIC programming language
You may also check:How to resolve the algorithm Average loop length step by step in the VBScript programming language
You may also check:How to resolve the algorithm Primality by Wilson's theorem step by step in the Tiny BASIC programming language