d.gabri3le
BAN USER
Comments (3)
Reputation 0
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
from math import sqrt
def get_primes(n):
primes = []
i = 1
while len(primes) < 10:
if i == 1:
primes.append(i)
else:
is_prime = True
for j in range(2, int(sqrt(i))+1):
if i % j == 0:
is_prime = False
break
if is_prime:
primes.append(i)
i = i + 1
return primes
print(get_primes(10))
Comment hidden because of low score. Click to expand.
0
of 0 vote
import bisect
def sort(n):
s = []
for i in range(1,1+n):
bisect.insort(s, str(i))
return s
print(digit_sort(1000))
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
- d.gabri3le October 20, 2014