Added previous assignments

This commit is contained in:
Shaquille K. Soekhlal
2019-09-12 08:55:54 +02:00
parent fc59dd3913
commit 395564a57a
7 changed files with 175 additions and 0 deletions

35
Assignment 4/2.c Normal file
View File

@ -0,0 +1,35 @@
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
int is_prime(int number)
{ /*Function decleration and definition */
int x, temp = 0;
printf("%d is being checked\n",number);
for (x = 2; pow(x, 2) >= number; x++) { /*using for loop to determine if input is not prime*/
printf("%d \t am in loop\n",number);
if (number < 2) { /*If number is 0 or 1, it is not prime*/
temp = 1;
printf("%d is below 2, is not prime\n",number);
}
if (number % x == 0) { /*If remainder of input/x^2 = 0 then the number is not prime*/
temp = 1;
printf("%d has another divisor, is not prime\n",number);
break;
}
}
if (temp == 0) { /*Print out number if the value of temp is not equal to 1 (so it outputs only prime number)*/
printf("%d\n", number);
}
return number;
}
int main()
{
int lower_limit, upper_limit, i; /*Declaring variables*/
scanf("%d%d", &lower_limit, &upper_limit); /*Storing user input in lower and upper limit variables*/
for (i = lower_limit; i <= upper_limit; i++) { /*using for loop to call is_prime function to calculate if the number is prime*/
is_prime(i);
}
return 0;
}

32
Assignment 4/main.c Normal file
View File

@ -0,0 +1,32 @@
/*
*Student: S.K Soekhlal
* Number: 4860632
* Assignment: 3.3
*/
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int is_prime(int number){ /*Function decleration and definition */
int x;
if(number < 2){ /*If number is 0 or 1, it is not prime*/
return 0;
}
for(x=2; pow(x,2)<=number; x++){ /*using for loop to determine if input is not prime*/
if (number%x == 0){ /*If remainder of input/x^2 = 0 then the number is not prime*/
return 0;
}
}
return 1;
}
int main(){
int lower_limit,upper_limit,i; /*Declaring variables*/
scanf("%d%d",&lower_limit,&upper_limit); /*Storing user input in lower and upper limit variables*/
for(i=lower_limit; i <= upper_limit; i++){ /*using for loop to call is_prime function to calculate if the number is prime*/
if(is_prime(i) == 1){
printf("%d\n",i);
}
}
return 0;
}