Breaking News: Grepper is joining You.com. Read the official announcement!

how to find prime numbers in an array

Add Answer

Muhammad Umair Khan answered on February 7, 2022 Popularity 6/10 Helpfulness 2/10

answer how to find prime numbers in an array

related how to find prime numbers in an array in javascript

related how to find prime numbers in an array

related Find all the prime numbers in the array

related how to find prime numbers in an array

how to find prime numbers in an array

Comment

#include <stdio.h>

//function to check number is prime or not
//function will return 1 if number is prime
int isPrime(int num)
{
	int i; //loop counter
	//it will be 1 when number is not prime
	int flag=0; 
	//loop to check number is prime or not
	//we will check, if number is divisible
	//by any number from 2 to num/2, then it
	//will not be prime
	for(i=2; i<num/2; i++)
	{
		if(num%i ==0)
		{
			flag =1;
			break;
		}
	}
	//flag is 1, if number is not prime
	if(flag==1)
		return 0;
	else
		return 1;
}

int main()
{
	int loop; //loop counter
	//declaring array with prime and not prime numbers
	int arr[]={100, 200, 31, 13, 97, 10, 20, 11};
	//calculate length of the array
	int len = sizeof(arr)/sizeof(arr[0]);
	
	//print array elements with message 
	//"prime" or "Not prime"
	for(loop=0; loop<len; loop++)
	{
		printf("%3d - %s\n",arr[loop],(isPrime(arr[loop])?"Prime":"Not Prime"));
	}
	
	printf("\n");
	
	return 0;	
}

Popularity 6/10 Helpfulness 2/10 Language c

Source: www.includehelp.com

Tags: c find numbers

Link to this answer
Share Copy Link

Contributed on Sep 30 2022

Muhammad Umair Khan

0 Answers Avg Quality 2/10

Closely Related Answers

how to find prime numbers in an array in javascript

Comment

// how to find prime numbers in an array in javascript
let numbers = [-1,-2,-3,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20];

let primeNumbers = numbers.filter(num => isPrime(num));

function isPrime(num) {
  for (let i = 2; i < num; i++) {
    if (num % i === 0) return false;
  }
  return num > 1;
}
console.log(primeNumbers); // // [ 2, 3, 5, 7, 11, 13, 17, 19]

Popularity 9/10 Helpfulness 10/10 Language javascript

Source: Grepper

Tags: find

Link to this answer
Share Copy Link

Contributed on Feb 07 2022

Chetan Nada

0 Answers Avg Quality 2/10

how to find prime numbers in an array

Comment

#include <stdio.h>

//function to check number is prime or not
//function will return 1 if number is prime
int isPrime(int num)
{
	int i; //loop counter
	//it will be 1 when number is not prime
	int flag=0; 
	//loop to check number is prime or not
	//we will check, if number is divisible
	//by any number from 2 to num/2, then it
	//will not be prime
	for(i=2; i<num/2; i++)
	{
		if(num%i ==0)
		{
			flag =1;
			break;
		}
	}
	//flag is 1, if number is not prime
	if(flag==1)
		return 0;
	else
		return 1;
}

int main()
{
	int loop; //loop counter
	//declaring array with prime and not prime numbers
	int arr[]={100, 200, 31, 13, 97, 10, 20, 11};
	//calculate length of the array
	int len = sizeof(arr)/sizeof(arr[0]);
	
	//print array elements with message 
	//"prime" or "Not prime"
	for(loop=0; loop<len; loop++)
	{
		printf("%3d - %s\n",arr[loop],(isPrime(arr[loop])?"Prime":"Not Prime"));
	}
	
	printf("\n");
	
	return 0;	
}

Popularity 6/10 Helpfulness 5/10 Language c

Source: www.includehelp.com

Tags: c find numbers

Link to this answer
Share Copy Link

Contributed on Sep 30 2022

Muhammad Umair Khan

0 Answers Avg Quality 2/10

Find all the prime numbers in the array

Comment

var numArray = [2, 3, 4, 5, 6, 7, 8, 9, 10]

numArray = numArray.filter((number) => {
  for (var i = 2; i <= Math.sqrt(number); i++) {
    if (number % i === 0) return false;
  }
  return true;
});

console.log(numArray);
 Run code snippetHide results

Popularity 4/10 Helpfulness 4/10 Language javascript

Source: stackoverflow.com

Tags: find javascript numbers

Link to this answer
Share Copy Link

Contributed on Nov 01 2022

TATHAGATA MISHRA

0 Answers Avg Quality 2/10

how to find prime numbers in an array

Comment

#include <stdio.h>

//function to check number is prime or not
//function will return 1 if number is prime
int isPrime(int num)
{
	int i; //loop counter
	//it will be 1 when number is not prime
	int flag=0; 
	//loop to check number is prime or not
	//we will check, if number is divisible
	//by any number from 2 to num/2, then it
	//will not be prime
	for(i=2; i<num/2; i++)
	{
		if(num%i ==0)
		{
			flag =1;
			break;
		}
	}
	//flag is 1, if number is not prime
	if(flag==1)
		return 0;
	else
		return 1;
}

int main()
{
	int loop; //loop counter
	//declaring array with prime and not prime numbers
	int arr[]={100, 200, 31, 13, 97, 10, 20, 11};
	//calculate length of the array
	int len = sizeof(arr)/sizeof(arr[0]);
	
	//print array elements with message 
	//"prime" or "Not prime"
	for(loop=0; loop<len; loop++)
	{
		printf("%3d - %s\n",arr[loop],(isPrime(arr[loop])?"Prime":"Not Prime"));
	}
	
	printf("\n");
	
	return 0;	
}

Popularity 6/10 Helpfulness 1/10 Language c

Source: www.includehelp.com

Tags: c find numbers

Link to this answer
Share Copy Link

Contributed on Sep 30 2022

Muhammad Umair Khan

0 Answers Avg Quality 2/10

how to find prime numbers in an array

Contents

More Related Answers

how to find prime numbers in an array

Closely Related Answers

how to find prime numbers in an array in javascript

how to find prime numbers in an array

Find all the prime numbers in the array

how to find prime numbers in an array

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.