It looks like you're new here. If you want to get involved, click one of these buttons!

- 140.8K All Categories
- 103.7K Programming Languages
- 6.5K Assembler Developer
- 1.9K Basic
- 40K C and C++
- 2.9K C#
- 7.9K Delphi and Kylix
- 4 Haskell
- 9.7K Java
- 4.1K Pascal
- 1.3K Perl
- 2K PHP
- 546 Python
- 37 Ruby
- 4.4K VB.NET
- 1.6K VBA
- 20.8K Visual Basic
- 2.6K Game programming
- 315 Console programming
- 90 DirectX Game dev
- 1 Minecraft
- 112 Newbie Game Programmers
- 2 Oculus Rift
- 9K Applications
- 1.8K Computer Graphics
- 740 Computer Hardware
- 3.4K Database & SQL
- 535 Electronics development
- 1.6K Matlab
- 628 Sound & Music
- 257 XML Development
- 3.3K Classifieds
- 199 Co-operative Projects
- 198 For sale
- 190 FreeLance Software City
- 1.9K Jobs Available
- 603 Jobs Wanted
- 209 Wanted
- 2.9K Microsoft .NET
- 1.8K ASP.NET
- 1.1K .NET General
- 3.4K Miscellaneous
- 8 Join the Team
- 354 Comments on this site
- 69 Computer Emulators
- 2.1K General programming
- 187 New programming languages
- 627 Off topic board
- 200 Mobile & Wireless
- 72 Android
- 126 Palm Pilot
- 338 Multimedia
- 154 Demo programming
- 184 MP3 programming
- Bash scripts
- 27 Cloud Computing
- 53 FreeBSD
- 1.7K LINUX programming
- 370 MS-DOS
- Shell scripting
- 321 Windows CE & Pocket PC
- 4.1K Windows programming
- 940 Software Development
- 417 Algorithms
- 68 Object Orientation
- 91 Project Management
- 95 Quality & Testing
- 268 Security
- 7.7K WEB-Development
- 1.8K Active Server Pages
- 61 AJAX
- 4 Bootstrap Themes
- 55 CGI Development
- 28 ColdFusion
- 224 Flash development
- 1.4K HTML & WEB-Design
- 1.4K Internet Development
- 2.2K JavaScript
- 37 JQuery
- 304 WEB Servers
- 150 WEB-Services / SOAP

paa_vvu
Member Posts: **3**

in Algorithms

please can anyone give me the algorithms for finding prime numbers below a number, given that number.

Terms of use / Privacy statement / Publisher: Lars Hagelin

Programmers Heaven articles / Programmers Heaven files / Programmers Heaven uploaded content / Programmers Heaven C Sharp ebook / Operated by CommunityHeaven

© 1997-2015 Programmersheaven.com - All rights reserved.

## Comments

1:

Hint:If a number is not divisible to any of the prime numbers below itself then it is a prime number too.

Create an array to hold the found prime numbers.

Add the first prime number 2 as the first object of the array.

Create a variable for current value and initialize it to 3.

In a loop which repeats the statements until the variable is updated to the given number take the remainder of the current variable/objects of the array(holds found prime numbers), add the current variable to the array if any of the remainders is equal to zero(this means none of the prime numbers divides the current value) and update the current variable by adding one to it.

After the break of loop you can print out the values in the array and see the prime numbers below the desired number.

I'm a first year computer science student.Sorry if i confused you. This is not an algorithm but i think it can give you a clue about how to solve the problem.

48[grey]please can anyone give me the algorithms for finding prime numbers below a number, given that number.

[/grey]

[green]

The maybe easiest implementation for an algorithm which finds primes

in a given range is the so-called "Sieve Of Erathostenes".

The advantages:

- you will find really every prime

- every found prime is 100% a prime

The disadvantages:

- the array takes a lot of memory

- the computation time is long for high ranges

If you need the "sieve" in another language than C/C++, just use any

search engine. You'll find everything you need ...

[/green]

[code][size=2]

#include

using namespace std;

int

main (void)

{

long max;

bool *primes;

cout << " Calculate prime numbers (sieve of Erathostenes)

";

cout << " Highest number to test: ";

cin >> max;

if (max < 2) {

cerr << " Error: Invalid value!

"

<< " Number must be greater than 2.

";

return 1;

}

[blue] // Create array and exclude 0 and 1[/blue]

primes = new bool[max + 1];

[blue] // Fill list with all positive integers[/blue]

for (long i=0; i<=max; i++)

primes[i] = true;

[blue] // The testing ...[/blue]

for (long i=2; i<=max; i++)

for (long j=2; i*j<max; j++)

primes[i*j] = false;

[blue] // The index of the array equals the numbers[/blue]

[blue] // If you want to look whether 7 is a prime, just try[/blue]

[blue] // if `(primes[7])'[/blue]

[blue] // Print them[/blue]

for (long i=2; i<=max; i++)

if (primes[i])

cout << i << endl;

delete[] primes;

return 0;

}

[/size][/code]

10: [grey]please can anyone give me the algorithms for finding prime numbers below a number, given that number.

: [/grey]

:

: [green]

: The maybe easiest implementation for an algorithm which finds primes

: in a given range is the so-called "Sieve Of Erathostenes".

:

: The advantages:

: - you will find really every prime

: - every found prime is 100% a prime

:

: The disadvantages:

: - the array takes a lot of memory

: - the computation time is long for high ranges

:

: If you need the "sieve" in another language than C/C++, just use any

: search engine. You'll find everything you need ...

: [/green]

:

: [code][size=2]

: #include

: using namespace std;

:

: int

: main (void)

: {

: long max;

: bool *primes;

:

: cout << " Calculate prime numbers (sieve of Erathostenes)

";

: cout << " Highest number to test: ";

: cin >> max;

:

: if (max < 2) {

: cerr << " Error: Invalid value!

"

: << " Number must be greater than 2.

";

: return 1;

: }

:

: [blue] // Create array and exclude 0 and 1[/blue]

: primes = new bool[max + 1];

:

: [blue] // Fill list with all positive integers[/blue]

: for (long i=0; i<=max; i++)

: primes[i] = true;

:

: [blue] // The testing ...[/blue]

: for (long i=2; i<=max; i++)

: for (long j=2; i*j<max; j++)

: primes[i*j] = false;

:

: [blue] // The index of the array equals the numbers[/blue]

: [blue] // If you want to look whether 7 is a prime, just try[/blue]

: [blue] // if `(primes[7])'[/blue]

:

: [blue] // Print them[/blue]

: for (long i=2; i<=max; i++)

: if (primes[i])

: cout << i << endl;

:

: delete[] primes;

: return 0;

: }

: [/size][/code]

:

:

:

Can you give me some pseudocode to Intel assembly? thanks didn't find it on google