User contributions
Jump to navigation
Jump to search
- 20:09, 30 May 2011 diff hist +8 99 questions/11 to 20 →Problem 12: code formatting
- 20:08, 30 May 2011 diff hist -7 99 questions/11 to 20 →Problem 11: code formatting
- 20:07, 30 May 2011 diff hist +13 99 questions/1 to 10 →Problem 9: code formatting
- 20:02, 30 May 2011 diff hist +194 99 questions/Solutions/84 code formatting
- 14:36, 28 May 2011 diff hist 0 Prime numbers →Postponed
- 14:26, 28 May 2011 diff hist +112 Prime numbers →Linear merging
- 14:23, 28 May 2011 diff hist +5 Prime numbers →Segmented
- 14:19, 28 May 2011 diff hist -432 Prime numbers →Guarded
- 14:14, 28 May 2011 diff hist +76 Prime numbers →Squared
- 14:11, 28 May 2011 diff hist +147 Prime numbers →Analysis
- 13:56, 28 May 2011 diff hist +253 Prime numbers →Prime Number Resources: added link to Melissa O'Neill's article
- 13:16, 28 May 2011 diff hist +130 Prime numbers →Euler's Sieve
- 13:11, 28 May 2011 diff hist 0 m Prime numbers →Conclusion
- 13:09, 28 May 2011 diff hist 0 m Prime numbers
- 13:07, 28 May 2011 diff hist +3,914 Prime numbers →Finding Primes: general re-write, starting with simplest and genuine Eratosthenes definition, not with Turner's
- 17:47, 31 March 2011 diff hist +26 Prime numbers →Using ST Array: correction: it's n(log n)(log (log n)), in n primes produced
- 17:40, 31 March 2011 diff hist +301 Prime numbers →Implicit Heap: small remark
- 09:04, 17 March 2011 diff hist +1 m Prime numbers →Using ST Array
- 09:02, 17 March 2011 diff hist +66 Prime numbers →Using ST Array: update reference to test code
- 02:45, 7 March 2011 diff hist +10 m Prime numbers →Using ST Array
- 01:32, 7 March 2011 diff hist +31 Talk:Introduction
- 01:31, 7 March 2011 diff hist +237 Talk:Introduction
- 01:25, 7 March 2011 diff hist +143 Introduction →Quicksort in Haskell: style edit
- 01:15, 7 March 2011 diff hist +655 Introduction →Quicksort in Haskell: added explanation for the code as per request on talk page
- 00:53, 7 March 2011 diff hist +212 Talk:Prime numbers
- 00:49, 7 March 2011 diff hist -1 Prime numbers →Generated Spans, by List of Primes: fixed primesFrom arguments order
- 11:23, 17 February 2011 diff hist +332 Prime numbers →Using ST Array: add remark on complexity for it and C++
- 23:20, 16 February 2011 diff hist 0 Prime numbers →Treefold Merged Multiples, with Wheel: correction
- 15:14, 16 February 2011 diff hist +60 Prime numbers →Treefold Merged Multiples, with Wheel: added remark about measured time complexity
- 14:53, 16 February 2011 diff hist -33 m Prime numbers →Treefold Merged Multiples, with Wheel
- 07:55, 13 February 2011 diff hist +628 Talk:Prime numbers ONeill test entry on Ideone.com
- 13:39, 10 February 2011 diff hist +322 Talk:Prime numbers ...and a few more...
- 13:27, 10 February 2011 diff hist +448 Talk:Prime numbers few more version-specific (old) links
- 11:25, 10 February 2011 diff hist +206 m Talk:Prime numbers added version-specific links
- 10:58, 7 February 2011 diff hist +26 m Talk:Prime numbers
- 18:31, 6 February 2011 diff hist +354 Talk:Prime numbers
- 18:20, 6 February 2011 diff hist +286 Prime numbers →Treefold Merged Multiples, with Wheel: speed compare to ONeillPrimesTest.hs with -O2 switch on ghc 6.10.1
- 07:40, 3 February 2011 diff hist +2 Prime numbers →Treefold Merged Multiples, with Wheel: cosmetic code change (better arg names)
- 07:09, 3 February 2011 diff hist +8 m Prime numbers →Treefold Merged Multiples, with Wheel
- 08:26, 2 February 2011 diff hist +89 Prime numbers →Treefold Merged Multiples, with Wheel: it is the best performing list-based version here, so far
- 08:07, 2 February 2011 diff hist -102 Prime numbers →Treefold Merged Multiples, with Wheel: new code, shorter, faster, with fused wheel streaming
- 23:45, 22 January 2011 diff hist +105 Prime numbers →Euler's Sieve: adding a link to Data.Ordlist.minus
- 23:08, 19 January 2011 diff hist +4 m Prime numbers →Finding Primes
- 11:10, 19 January 2011 diff hist -2 m Prime numbers →Postponed Filters Sieve
- 11:07, 19 January 2011 diff hist -213 Prime numbers →Getting the Composite Numbers Out: extra sentence removed
- 11:01, 19 January 2011 diff hist -6 m Prime numbers →Finding Primes: removing extraneous details from summarization
- 08:21, 19 January 2011 diff hist +767 Prime numbers →Finding Primes: summary expanded a bit
- 12:51, 11 January 2011 diff hist -129 Talk:Monad current
- 02:32, 31 December 2010 diff hist +1 m Prime numbers →Treefold Merged Multiples Removal
- 14:05, 28 December 2010 diff hist +24 m Prime numbers →Treefold Merged Multiples Removal
- 13:59, 28 December 2010 diff hist +6 Prime numbers →Treefold Merged Multiples Removal
- 13:42, 28 December 2010 diff hist -1 m Prime numbers →Merged Multiples Removal Sieve
- 10:29, 28 December 2010 diff hist 0 Prime numbers →Merged Multiples Removal Sieve: foldr1 changed to foldr; reduces efficiency for no reason other than dubious convenience
- 19:51, 26 December 2010 diff hist -3 m Prime numbers →Using IntSet for a traditional sieve
- 19:29, 26 December 2010 diff hist 0 Prime numbers tfold function renamed foldt
- 18:57, 26 December 2010 diff hist +32 Prime numbers moved section on Segmented Removal under Postponed Removal, some minor style edits
- 08:17, 26 December 2010 diff hist -8 Prime numbers rearranging the ranks of sections to put forward the better variants
- 08:07, 26 December 2010 diff hist +13 Prime numbers →Multiples Removal on Generated Spans, or Sieve of Eratosthenes
- 06:03, 25 December 2010 diff hist -93 Prime numbers →Treefold Merged Multiples Removal: minor fix
- 13:04, 23 December 2010 diff hist -54 m Prime numbers →Treefold Merged Multiples, with Wheel
- 12:48, 23 December 2010 diff hist -26 Prime numbers →Treefold Merged Multiples, with Wheel: code improvement: initial (pairs) gives 2.5% speedup at 2mln primes
- 11:13, 23 December 2010 diff hist -4 m Prime numbers →Treefold Merged Multiples Removal
- 11:10, 23 December 2010 diff hist -39 Prime numbers →Postponed Multiples Removal: small code style edits
- 10:47, 23 December 2010 diff hist 0 m Prime numbers →Treefold Merged Multiples Removal
- 07:50, 23 December 2010 diff hist +7 m Prime numbers →Treefold Merged Multiples, with Wheel
- 07:47, 23 December 2010 diff hist -2,433 Prime numbers →Postponed Multiples Removal: MAJOR code simplification; removed the whole discussion of type symmetry of monoidal bin-op as it's become irrelevant
- 06:58, 23 December 2010 diff hist +1 m Prime numbers →Getting the Composite Numbers Out
- 06:57, 23 December 2010 diff hist +83 Prime numbers →Euler's Sieve
- 06:48, 23 December 2010 diff hist +226 Prime numbers →Generated Spans, by List of Primes: remark about algorithmical similarity
- 07:25, 21 December 2010 diff hist +2 Data.List.Split →Simple split at known length
- 21:56, 15 December 2010 diff hist +2 m Monad Undo revision 37872 by WillNess (Talk)
- 13:08, 12 December 2010 diff hist -2 m Monad
- 11:55, 12 December 2010 diff hist 0 m Monad →Special notation
- 11:54, 12 December 2010 diff hist +8 m Monad →Special notation: make code fit
- 10:24, 9 December 2010 diff hist 0 Prime numbers →Treefold Merged Multiples, with Wheel: code error fixed (typo)
- 13:27, 5 December 2010 diff hist -6 m Testing primality →Miller-Rabin Primality Test: fit code
- 10:39, 5 December 2010 diff hist -38 m Prime numbers →Bitwise prime sieve with Template Haskell: just moving a code little bit to the left to make it fit
- 10:23, 5 December 2010 diff hist +116 Prime numbers →Postponed Multiples Removal: small style edits
- 09:36, 5 December 2010 diff hist -16 Prime numbers →Generated Spans, by Nested Filters: small style edit
- 09:28, 5 December 2010 diff hist -25 m Prime numbers →Odd numbers, by Trial Division
- 21:59, 4 December 2010 diff hist +9 Prime numbers code formatting
- 17:26, 23 November 2010 diff hist 0 m Prime numbers
- 17:21, 23 November 2010 diff hist +8 m Prime numbers
- 17:11, 23 November 2010 diff hist -754 Prime numbers ... some more edits; removed type annotations - use your own (I test [Int] on ideone - it never reaches above its range in the time limit there)
- 08:42, 23 November 2010 diff hist +304 Prime numbers some clarifications
- 02:49, 12 November 2010 diff hist -4 Prime numbers in Turner's, mod/rem -> 1.37x slower
- 17:03, 26 October 2010 diff hist -1 m Introduction typo in qsort C code
- 06:59, 16 October 2010 diff hist +6 m Talk:Prime numbers
- 17:41, 15 October 2010 diff hist +104 m Talk:Prime numbers re-linked the links to older versions of this page
- 17:24, 15 October 2010 diff hist +50 Talk:Prime numbers link to data-ordlist
- 08:47, 4 October 2010 diff hist +41 Monad added link to "What a Monad is not"
- 08:42, 4 October 2010 diff hist +20 m What a Monad is not
- 19:18, 3 October 2010 diff hist +6 Talk:Monad
- 21:58, 26 September 2010 diff hist +114 Prime numbers using arrays is NOT the most memory efficient (that's wheel/merge which is nearly constant)
- 00:56, 26 September 2010 diff hist +58 m Talk:Introduction (forgot to sign)
- 00:55, 26 September 2010 diff hist +650 Talk:Introduction improved Haskell qsort code moved here from main page
- 00:53, 26 September 2010 diff hist -326 Introduction removed superfluous qsort improvement code to the talk page
- 21:29, 22 August 2010 diff hist +44 Prime numbers give link to test code on ideone
- 16:17, 15 August 2010 diff hist -1,789 Prime numbers taking out parts of the page, it's gotten too large (bigger than 31K).
- 16:15, 15 August 2010 diff hist +1,924 N Testing primality taking parts out from the Prime_numbers page (it's gotten too big)