OPTIMIZATION BENCHMARKS: POWER OF 2 MULTIPLICATIONS

This example tries to measure the time needed to multiply a number that is a multiple of 2. This type of calculation is not performed like a classic multiplication, but by using a bit shift.

source compile sandbox issues? back to examples

SOURCE CODE ()

	CONST maxCounter = 30000

	CLS
	
	originalValue = 42
	
	startTime = TIME
	
	counter = 0
	DO
		targetValue = originalValue**8
		INC counter
		EXIT IF counter = maxCounter
	LOOP
	
	PRINT (TIME - startTime); " jiffy(s)"
	
	PRINT originalValue;" x 8 = ";targetValue

How to compile and run the example

The instructions here refer to compiling the example from the command line. For Microsoft Windows users we suggest using UGBASIC-IDE, which allows you to download and compile each single example with just one click.

Are instructions for your specific home computer / console missing? First of all, check if your computer is supported by clicking here. If so, since ugBASIC is a language which does not provide abstractions, it is possible that this example will not work on your target. If you think this is an issue, please click here.

Any problem?

If you have found a problem trying to run this example, if you think there is a bug or, more simply, you would like it to be improved, open an issue for this example on GitHub.
Thank you!

open an issue BACK TO EXAMPLES