Search results
Jump to navigation
Jump to search
Page title matches
- 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 fun2 KB (283 words) - 06:18, 15 July 2008
- 12 bytes (1 word) - 07:31, 25 September 2007
- 190 bytes (24 words) - 04:42, 5 August 2008
- | pagename = Big O notation | abc = Big O notation782 bytes (77 words) - 07:58, 15 March 2024
- 12 bytes (1 word) - 07:32, 25 September 2007
- 326 bytes (43 words) - 06:16, 15 July 2008
- The '''big O notation''' is a mathematical notation to express various bounds concerning asympto422 bytes (57 words) - 15:04, 28 September 2007
Page text matches
- #REDIRECT [[Big O notation]]28 bytes (4 words) - 11:22, 7 August 2008
- | pagename = Big O notation | abc = Big O notation782 bytes (77 words) - 07:58, 15 March 2024
- {{r|Big O notation}}274 bytes (38 words) - 11:28, 7 August 2008
- 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 fun2 KB (283 words) - 06:18, 15 July 2008
- * [[Big O notation]] - A system for expressing behavior of algorithms.495 bytes (65 words) - 03:16, 9 June 2008
- The '''big O notation''' is a mathematical notation to express various bounds concerning asympto422 bytes (57 words) - 15:04, 28 September 2007
- [[Big O notation]]2 KB (354 words) - 20:39, 20 February 2010
- {{r|Big O notation}}106 bytes (13 words) - 04:38, 5 August 2008
- {{r|Big O notation}}774 bytes (99 words) - 15:36, 11 January 2010
- ...rule, should I explain that in the article text instead of just linking to Big O Notation? --[[User:Nick Johnson|Nick Johnson]] 15:57, 21 February 2007 (CST)4 KB (717 words) - 22:32, 16 January 2008
- {{r|Big O notation}}3 KB (353 words) - 03:48, 24 September 2013
- {{r|Big O notation}}774 bytes (100 words) - 18:05, 11 January 2010
- ...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
- ...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 statement7 KB (1,080 words) - 07:53, 10 August 2008
- == Big O notation == ...on of an editor would be appreciated. So could you please take a look at [[Big O notation]] and my rationale given [[User_Talk:D. Matt Innis|Matt's talk page]] and l8 KB (1,252 words) - 11:12, 30 October 2011
- ...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
- Hi Pat. I just updated the entries on [[big O notation]] and [[little o notation]] in the mathematics section and thought you may29 KB (4,704 words) - 08:34, 2 March 2024
- ...icameral legislature]], [[Bicycle]], [[Big cat]], [[Bigelow Aerospace]], [[Big O notation]], [[Bill Clinton]], [[Bill Johnston]], [[Bill Maher]], [[Bill of rights]],18 KB (1,846 words) - 09:34, 16 April 2024
- ...icameral legislature]], [[Bicycle]], [[Big cat]], [[Bigelow Aerospace]], [[Big O notation]], [[Bill Clinton]], [[Bill Johnston]], [[Bill Maher]], [[Bill of rights]],18 KB (1,846 words) - 09:34, 16 April 2024
- * moving "Big O notation" to "Complexity of algorithms" (would appreciate comments from computer wor * deleting the resulting redirect "Big O notation". This will be something different.84 KB (14,421 words) - 00:10, 25 November 2008