Big O notation (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Big O notation" in English language version.

refsWebsite
Global rank English rank
1st place
1st place
6th place
6th place
2nd place
2nd place
3rd place
3rd place
5th place
5th place
11th place
8th place
low place
low place
low place
low place
451st place
277th place
179th place
183rd place
low place
low place
3,707th place
2,409th place
2,467th place
2,049th place
8,650th place
7,668th place
163rd place
185th place
low place
low place
207th place
136th place
3,087th place
2,519th place
415th place
327th place
1,670th place
2,355th place

ams.org

archive.org

  • Bachmann, Paul (1894). Analytische Zahlentheorie [Analytic Number Theory] (in German). Vol. 2. Leipzig: Teubner.
  • Landau, Edmund (1909). Handbuch der Lehre von der Verteilung der Primzahlen [Handbook on the theory of the distribution of the primes] (in German). Leipzig: B. G. Teubner. p. 883.
  • Landau, Edmund (1909). Handbuch der Lehre von der Verteilung der Primzahlen [Handbook on the theory of the distribution of the primes] (in German). Leipzig: B.G. Teubner. p. 31.
  • Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L. (2009). Introduction to Algorithms (3rd ed.). Cambridge/MA: MIT Press. p. 45. ISBN 978-0-262-53305-8. Because θ(g(n)) is a set, we could write "f(n) ∈ θ(g(n))" to indicate that f(n) is a member of θ(g(n)). Instead, we will usually write f(n) = θ(g(n)) to express the same notion. You might be confused because we abuse equality in this way, but we shall see later in this section that doing so has its advantages.
  • Cormen et al. (2009), p. 53
  • Landau, Edmund (1909). Handbuch der Lehre von der Verteilung der Primzahlen [Handbook on the theory of the distribution of the primes] (in German). Leipzig: B. G. Teubner. p. 61.
  • Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L. (2009). Introduction to Algorithms (3rd ed.). Cambridge/MA: MIT Press. p. 49. ISBN 978-0-262-53305-8. When the asymptotic notation stands alone (that is, not within a larger formula) on the right-hand side of an equation (or inequality), as in n = O(n2), we have already defined the equal sign to mean set membership: n ∈ O(n2). In general, however, when asymptotic notation appears in a formula, we interpret it as standing for some anonymous function that we do not care to name. For example, the formula 2n2 + 3n + 1 = 2n2 + θ(n) means that 2n2 + 3n + 1 = 2n2 + f(n), where f(n) is some function in the set θ(n). In this case, we let f(n) = 3n + 1, which is indeed in θ(n). Using asymptotic notation in this manner can help eliminate inessential detail and clutter in an equation.
  • Landau, Edmund (1909). Handbuch der Lehre von der Verteilung der Primzahlen [Handbook on the theory of the distribution of the primes] (in German). Leipzig: B. G. Teubner. p. 62.
  • Hardy, G. H. (1910). Orders of Infinity: The 'Infinitärcalcül' of Paul du Bois-Reymond. Cambridge University Press. p. 2.

austinmohr.com

books.google.com

doi.org

google.com

helsinki.fi

cs.helsinki.fi

kestrel.edu

ksu.edu

people.cis.ksu.edu

mcgraw-hill.com

highered.mcgraw-hill.com

mit.edu

mitpress.mit.edu

numdam.org

archive.numdam.org

projecteuclid.org

psu.edu

citeseerx.ist.psu.edu

semanticscholar.org

api.semanticscholar.org

stanford.edu

www-cs-staff.stanford.edu

uiuc.edu

math.uiuc.edu

  • for example it is omitted in: Hildebrand, A.J. "Asymptotic Notations" (PDF). Department of Mathematics. Asymptotic Methods in Analysis. Math 595, Fall 2009. Urbana, IL: University of Illinois. Archived (PDF) from the original on 14 March 2017. Retrieved 14 March 2017.

uu.nl

phil.uu.nl

web.archive.org

worldcat.org