English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

2006-10-02 21:41:52 · 4 answers · asked by origamix60 3 in Science & Mathematics Mathematics

4 answers

The big O means 'on the order of'. It is *not* a particular value. If I say a particular algorithm runs as O√n then it means that if it takes 5 seconds to run with 10 data values (n is the number of values) then it will take about 10 seconds to run with 40 values (40 = 4*10, √4 = 2, so about 2 times as long)


Doug

2006-10-02 22:25:35 · answer #1 · answered by doug_donaghue 7 · 0 0

Big O notation - Wikipedia, the free encyclopediaBig O notation is useful when analyzing algorithms for efficiency. For example, the time (or the number of steps) it takes to complete a problem of size n ...
en.wikipedia.org/wiki/Big_O_notation - 50k -
big-O notationDefinition of big-O notation, possibly with links to more information and implementations.
www.nist.gov/dads/HTML/bigOnotation.html -

2006-10-03 05:14:24 · answer #2 · answered by Anonymous · 0 1

O(837) = 837 is about 1000 = the order of magnitude of 837 is 10^3

Th

2006-10-03 06:31:09 · answer #3 · answered by Thermo 6 · 0 1

What actually is the big - O notation ?

2006-10-03 06:16:07 · answer #4 · answered by nayanmange 4 · 0 2

fedest.com, questions and answers