User contributions
Jump to navigation
Jump to search
- 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)
- 16:10, 15 August 2010 diff hist -1 m Prime numbers
- 16:07, 15 August 2010 diff hist -5 m Prime numbers
- 10:34, 13 August 2010 diff hist +213 Talk:Prime numbers
- 09:30, 13 August 2010 diff hist +837 Prime numbers new, faster Treefold-Wheel, ST Array on odds
- 11:00, 6 August 2010 diff hist +239 Talk:Prime numbers
- 08:33, 6 August 2010 diff hist -10 Prime numbers ditto
- 18:45, 5 August 2010 diff hist -102 Prime numbers small code style edits
- 09:31, 5 August 2010 diff hist +215 Prime numbers tfold more properly abstracted
- 22:45, 4 August 2010 diff hist +12 m Prime numbers
- 21:53, 4 August 2010 diff hist -240 Prime numbers simplified tfold, merging versions
- 07:42, 4 August 2010 diff hist +554 Prime numbers not-so-ugly rollFrom ; double primes feed in treefold wheel, to save memory
- 15:59, 31 July 2010 diff hist +55 Prime numbers immutable array code is the fastest of all its predecessors
- 15:54, 31 July 2010 diff hist +173 Prime numbers moved faster immutable arrays code here from the talk page