From 93ea7fe5957b62f18e8fbd17a21696bd7de6332d Mon Sep 17 00:00:00 2001
From: mjfernez <mjfernez@gmail.com>
Date: Sun, 9 Feb 2020 15:16:26 -0500
Subject: Organized everything, update README

---
 10001prime.c | 42 ------------------------------------------
 1 file changed, 42 deletions(-)
 delete mode 100644 10001prime.c

(limited to '10001prime.c')

diff --git a/10001prime.c b/10001prime.c
deleted file mode 100644
index 2ef3bd8..0000000
--- a/10001prime.c
+++ /dev/null
@@ -1,42 +0,0 @@
-#include <stdio.h>
-#include <stdlib.h>
-#include <math.h>
-int n = 1000000;
-
-int *listPrimes(int num){
-	int i;
-	int *primes;
-	int *sieve = (int *) malloc(num * sizeof(int));
-	//initialize to all 1s (except 0 and 1 which are not prime)
-	for(i = 2; i < num; i++)
-		sieve[i] = 1;
-	for(i = 2; i < ceil(sqrt(num)); i++){
-		if(sieve[i] ==  1){
-			int j = i * i;
-			while(j < num){
-				sieve[j] = 0;
-				j += i;
-			}
-		}
-	}
-	
-	//now check which were prime
-	int s = 0;
-	primes = (int *) malloc(sizeof(int));
-	for(i = 2; i < num; i++){
-		if(sieve[i]){
-			primes[s] = i;
-			s++;
-			primes = (int *) realloc (primes, (s + 1) * sizeof(int));
-		}
-	}
-
-	return primes;
-}
-
-int main(){
-	int *p = listPrimes(n);
-	int prime10001 = p[10000];
-	printf("%d\n", prime10001);
-	return 0;
-}
-- 
cgit v1.2.3