3.2.2 - Time to Match 2

You will now add a real time measuring to the earlier TimeToMatch, which originally just showed the number of iterations before a random number was found.

This will be implemented using a sequence diagram, where the time is read when starting the tast and ended when the number is found.

The difference between the two shows the time in milliseconds. NB: You need to find a very large number, as modern processors are extremely fast - to find a number between e.g. 1 and 10.000 takes under 1 ms…

  • Open TimeToMatch.vi
  • Save it as TimeToMatch2.vi
  • Use a flat sequence structure, and two "Tick Counts" to calculate the time to arrive at the random number
  • Save your VI
Created by Samuel Thrysøe © 2013