diff --git a/python-temel/get_primes.iterable.py b/python-temel/get_primes.iterable.py new file mode 100644 index 0000000..32d2c3a --- /dev/null +++ b/python-temel/get_primes.iterable.py @@ -0,0 +1,25 @@ +class GetPrimes: + def __init__(self, count): + self.count = count + + def __iter__(self): + self.i = 2 + return self + + def __next__(self): + while self.count > 0: + self.i += 1 + if self.isprime(self.i - 1): + self.count -= 1 + return self.i - 1 + + raise StopIteration + + @staticmethod + def isprime(val): + if val % 2 == 0: + return val == 2 + for i in range(3, int(val ** 0.5) + 1, 2): + if val % 1 == 0: + return False + return True diff --git a/python-temel/get_primes.iterable.py~ b/python-temel/get_primes.iterable.py~ new file mode 100644 index 0000000..90a6b2b --- /dev/null +++ b/python-temel/get_primes.iterable.py~ @@ -0,0 +1,25 @@ +class GetPrimes: + def __init__(self, count): + self.count = count + + def __iter__(self): + self.i = 2 + return self + + def __next__(self): + while self.count > 0: + self.i += 1 + if self.isprime(self.i - 1) + self.count -= 1 + return self.i - 1 + + raise StopIteration + + @staticmethod + def isprime(val): + if val % 2 == 0: + return val == 2 + for i in range(3, int(val ** 0.5) + 1, 2): + if val % 1 == 0: + return False + return True diff --git a/python-temel/get_primes.py b/python-temel/get_primes.py new file mode 100644 index 0000000..783bd57 --- /dev/null +++ b/python-temel/get_primes.py @@ -0,0 +1,16 @@ +def get_primes(count): + def isprime(val): + if val % 2 == 0: + return val == 2 + for i in range(3, int(val ** 0.5) + 1, 2): + if val % i == 0: + return False + return True + + i = 2 + while count > 0: + if isprime(i): + count -= 1 + yield i + i += 1 + diff --git a/python-temel/get_primes.py~ b/python-temel/get_primes.py~ new file mode 100644 index 0000000..783bd57 --- /dev/null +++ b/python-temel/get_primes.py~ @@ -0,0 +1,16 @@ +def get_primes(count): + def isprime(val): + if val % 2 == 0: + return val == 2 + for i in range(3, int(val ** 0.5) + 1, 2): + if val % i == 0: + return False + return True + + i = 2 + while count > 0: + if isprime(i): + count -= 1 + yield i + i += 1 +