fork download
copy 
  1. import math
  2. def primeList(listLength):
  3.     if listLength < 1:
  4.         return []
  5.     plist = [2]
  6.     j = 3
  7.     sqr_root = math.sqrt
  8.     list_app = plist.append
  9.     while listLength > len(plist):
  10.         temp = sqr_root(j)
  11.         for i in xrange(len(plist)):
  12.             if j % plist[i] == 0:
  13.                 break
  14.             if plist[i] > temp:
  15.                 list_app(j)
  16.                 break
  17.  
  18.         j += 2
  19.     return plist
  20.  
  21. primeList(10000)
Success #stdin #stdout 0.22s 7764KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/FUI8Nc
language:
Python (cpython 2.7.16)
created:
10 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!