Nitpick: Your algorithm is not sieve of Eratosthenes. The later only looks over the primes in its outer loop. Yours loop over every number. Sieve of Eratosthenes also uses only addition and array lookups. Yours uses multiplication, hashing and sorting.
Slashdot videos: Now with more Slashdot!
We've improved Slashdot's video section; now you can view our video interviews, product close-ups and site visits with all the usual Slashdot options to comment, share, etc. No more walled garden! It's a work in progress -- we hope you'll check it out (Learn more about the recent updates).
The Slashdot post I was expecting
Anyways, it's just too opinionated, from his 4 examples - PHP, JS, Python, Ruby - only PHP and JS are really widespread, with Ruby still rather rare and Python somewhere inbetween.
And then there's this pearl:
From TIOBE http://www.tiobe.com/index.php/content/paperinfo/tpci/index.html :
From LangPop http://langpop.com/ :
Just for the record. Certainly they are all very popular languages.
Seams boxing isn't too much of an issue for vanilla python when summing 1000,000 integers.
$ pypy -m timeit "sum(range(1000000))"
10 loops, best of 3: 55.2 msec per loop
$ python -m timeit "sum(range(1000000))"
10 loops, best of 3: 71.5 msec per loop
$ python3 -m timeit "sum(range(1000000))"
10 loops, best of 3: 62.7 msec per loop
$ python -m timeit "sum(xrange(1000000))"
10 loops, best of 3: 26.6 msec per loop
$ pypy -m timeit "sum(xrange(1000000))"
10 loops, best of 3: 132 msec per loop
$ pypy --version
Python 2.7.1 (?, May 02 2011, 19:05:35)
[PyPy 1.5.0-alpha0 with GCC 4.6.0]
$ python --version
$ python3 --version
Myself I have bought a few apps from the Android marked after a friend, who got them for free on Amazon, showed them to me.
If your app is good, I expect a 100k userbase will be quite viral.
It doesn't only depend on hardware setup. It depends on the number of keys!
Unless the algorithm is actually O(n) and not O(n log n), the speed drops width the increase of keys to sort.
After about a year of using Google groups for the PyChess project, I started feeling a problem. When I wrote mails to the list, no one would answer. And when I answered other peoples post, they seamed to ignore them and press for new answers. As I tried to check the online group to see what was happening, I got a 403 Forbidden error. After a short while I realised that this error was given for any page one the groups.google.com sub domain.
The lockout meant that I was unable to manage the PyChess mailing list. I was unable to fight the, at that time, increasing spam level; and more importantly I couldn't reply anybody in my community. I wasn't even able to visit the Google help fora, which are all on groups.google.com.
As the services are free of charge, I never really expected any support options. However I also never really expected the need for them. When things failed, I saw no way to buy the missing support, and the friendly facade suddenly seamed like a tall dark wall.
Perhaps the grief of this issue is in its rareness, but how can we know how often this kind of thing happens? If any admin can lock you all out by a sloppy click, and give you no option to defend yourself, then it is bound to happen once in a while."
Link to Original Source
When we got 100/100 fiber we had a lot of problems with our router. Eventually the ISP actually sent us a very nice router as an excuse for a couple of things.
The router is a Dlink DIR-655 Xtreme N Gigabit Router and the internet has worked flawlessly ever since.
Carrots and potatoes probably feel pain,
but it would be plain stupid of Apples and Oranges did. After all their purpose in life is to get eaten.
I read another thread proposing a time minimum and maximum for captchas.
The minimum to slow bruteforcers.
The maximum to stress captcha farms.
I wonder if it will use a knowledge base, or if it will be able to, just like another famous answering machine, deduce the existence of rice pudding.
Also I believe some applications let you choose a colour for your text. For example grey.