Search results

Page title matches

• Big O notation
  The '''big O notation''' is a mathematical notation to express various bounds concerning asymptot The big O notation is also often used to indicate that the absolute value of a real valued fun
  2 KB (283 words) - 06:18, 15 July 2008
• Big O notation/Approval
  12 bytes (1 word) - 07:32, 25 September 2007
• Big O notation/Definition
  190 bytes (24 words) - 04:42, 5 August 2008
• Big O notation/Related Articles
  326 bytes (43 words) - 06:16, 15 July 2008

Page text matches

• Big-oh notation
  #REDIRECT [[Big O notation]]
  28 bytes (4 words) - 11:22, 7 August 2008
• Complexity of algorithms/Related Articles
  {{r|Big O notation}}
  274 bytes (38 words) - 11:28, 7 August 2008
• Big O notation
  The '''big O notation''' is a mathematical notation to express various bounds concerning asymptot The big O notation is also often used to indicate that the absolute value of a real valued fun
  2 KB (283 words) - 06:18, 15 July 2008
• Donald Knuth/Related Articles
  * [[Big O notation]] - A system for expressing behavior of algorithms.
  495 bytes (65 words) - 03:16, 9 June 2008
• Little o notation
  [[Big O notation]]
  2 KB (354 words) - 20:39, 20 February 2010
• Little o notation/Related Articles
  {{r|Big O notation}}
  106 bytes (13 words) - 04:38, 5 August 2008
• Computational complexity theory/Related Articles
  {{r|Big O notation}}
  774 bytes (99 words) - 15:36, 11 January 2010
• Computer science/Related Articles
  {{r|Big O notation}}
  3 KB (353 words) - 03:48, 24 September 2013
• Limit (mathematics)/Related Articles
  {{r|Big O notation}}
  774 bytes (100 words) - 18:05, 11 January 2010
• Hash table
  ...insertion, deletion, or lookup of an element in a hash table takes only [[big O notation|O(1)]], which means that the time necessary to perform these actions does n ...grow very long. In that case, insertions, deletions and lookups slow to [[big O notation|O(n)]], where n is the length of the longest list.
  5 KB (832 words) - 13:00, 16 January 2008
• Complexity of algorithms
  ...n algorithm is expressed by the worst-case [[execution time]], using the [[big O notation]]. It is generally written as <math>O(f(x_1, x_2, \ldots, x_n))</math>, whe The big O notation expresses the complexity of an algorithm without restricting the statement
  7 KB (1,080 words) - 07:53, 10 August 2008
• Computational complexity theory
  ...tly what machine or language is being used. To avoid that problem, the [[Big O notation]] is generally used. If a problem has time complexity O(''n''²) on one ty ...ut a problem with pen and paper. Space complexity is also measured with [[Big O notation]].
  17 KB (2,637 words) - 13:14, 6 November 2010