Algorithm Timer - Computer Science Field Guide

CSFG

English Deutsch Beta Español Beta język polski (2.6.0)

Chapters Curriculum Guides Appendices

Algorithm Timer

Algorithm complexity:

log(n)

n

nlog(n)

n²

n³

n⁴

n⁶

2ⁿ

n!

Results:

Long form

Scientific

Number of items (n):

Please enter a positive integer.

This number is too big for the chosen complexity!

Operations per second:

Please enter a positive number.

This number is too big!

Processors:

Please enter a positive integer.

This number is too big!

n² operations would take:

Nanoseconds

Microseconds

Milliseconds

Seconds

Minutes

Hours

Days

Years

Centuries

This definition is not available in English, sorry!