Complexity of algorithms: Revision history

10 August 2008

• curprev 07:5307:53, 10 August 2008‎ imported>Jitse Niesen‎ 6,770 bytes +6,770‎ →‎Bubble sort: I think it's easier to understand if the index i does not shift from 0, ..., N-1 to 1, ..., N; also minor formatting

8 August 2008

• curprev 02:2402:24, 8 August 2008‎ imported>Andrey Khalyavin‎ 6,729 bytes +2‎ →‎Bubble sort
• curprev 02:2302:23, 8 August 2008‎ imported>Andrey Khalyavin‎ 6,727 bytes −127‎ →‎Bubble sort

7 August 2008

• curprev 11:3011:30, 7 August 2008‎ imported>Jitse Niesen‎ 6,854 bytes −104‎ zero variables is nonsense because O notation is asymptotic, move "see also" to subpage, link to an existing page

5 January 2008

• curprev 21:4521:45, 5 January 2008‎ imported>Warren Schudy‎ 6,958 bytes +15‎ →‎Classes of complexity

28 December 2007

• curprev 14:2314:23, 28 December 2007‎ imported>Ro Thorpe‎ m 6,943 bytes 0‎ No edit summary

18 November 2007

• curprev 11:0811:08, 18 November 2007‎ imported>Jitse Niesen‎ 6,943 bytes −84‎ →‎Expected Case, Best Case: remove "The expected case is generally written as <math>\Theta( f(x_1, x_2, \ldots, x_n) )</math>"; f = Theta(g) usually means f = O(g) and g = O(f)
• curprev 06:4706:47, 18 November 2007‎ imported>Ragnar Schroder‎ m 7,027 bytes +7,027‎ Added omitted "is"
• curprev 06:4606:46, 18 November 2007‎ imported>Ragnar Schroder‎ 7,024 bytes +447‎ →‎See Also: Added link to existing article

15 November 2007

• curprev 16:2216:22, 15 November 2007‎ imported>Ragnar Schroder‎ 6,986 bytes +409‎ Slightly modifying the structure, adding a few lines.

26 September 2007

• curprev 06:5006:50, 26 September 2007‎ imported>Subpagination Bot‎ m 6,577 bytes +6,577‎ Add {{subpages}} and remove any categories (details)

29 April 2007

• curprev 14:0014:00, 29 April 2007‎ imported>Catherine Woodgold‎ 6,658 bytes +93‎ labelling exponential time
• curprev 13:5813:58, 29 April 2007‎ imported>Catherine Woodgold‎ 6,565 bytes +73‎ O means "order".
• curprev 12:4412:44, 29 April 2007‎ imported>Petréa Mitchell‎ m 6,492 bytes +5‎ Link to big O notation

11 April 2007

• curprev 13:5713:57, 11 April 2007‎ imported>Nick Johnson‎ m 6,488 bytes +1‎ aymptotic -> asymptotic

26 March 2007

• curprev 18:1318:13, 26 March 2007‎ imported>Aleksander Stos‎ m 6,487 bytes +6,487‎ one paragraph
• curprev 18:1218:12, 26 March 2007‎ imported>Aleksander Stos‎ 6,488 bytes −45‎ adjustment to the new situation
• curprev 17:3617:36, 26 March 2007‎ imported>D. Matt Innis‎ m 6,533 bytes +6,533‎ Big O notation moved to Complexity of algorithms: per math author request and computer editor approval

22 February 2007

• curprev 13:2913:29, 22 February 2007‎ imported>Nick Johnson‎ m 6,533 bytes +6,533‎ added/changed comments to the math
• curprev 13:2313:23, 22 February 2007‎ imported>Nick Johnson‎ 6,476 bytes +6,476‎ Fixed the final inequality. Limit was inappropriate since limit may not exist.
• curprev 13:1813:18, 22 February 2007‎ imported>Nick Johnson‎ 6,447 bytes +1‎ No edit summary
• curprev 13:0713:07, 22 February 2007‎ imported>ZachPruckowski‎ m 6,446 bytes +6,446‎ No edit summary
• curprev 11:2011:20, 22 February 2007‎ imported>Nick Johnson‎ m 6,440 bytes +1‎ →‎Quick Sort
• curprev 11:1511:15, 22 February 2007‎ imported>Nick Johnson‎ m 6,439 bytes 0‎ two typos
• curprev 11:1211:12, 22 February 2007‎ imported>Nick Johnson‎ 6,439 bytes +4,384‎ Added best, expected case; added bubble and quick sort examples.

21 February 2007

• curprev 17:1417:14, 21 February 2007‎ imported>Robert Tito‎ m 2,055 bytes −3‎ No edit summary
• curprev 17:1317:13, 21 February 2007‎ imported>Robert Tito‎ m 2,058 bytes +98‎ No edit summary
• curprev 17:1317:13, 21 February 2007‎ imported>Nick Johnson‎ 2,058 bytes +98‎ No edit summary
• curprev 17:1217:12, 21 February 2007‎ imported>Nick Johnson‎ 1,960 bytes +1,960‎ fixed broken math markup
• curprev 17:1117:11, 21 February 2007‎ imported>Nick Johnson‎ 1,944 bytes +1,944‎ No edit summary