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

- 140.6K All Categories
- 104.4K Programming Languages
- 6.4K Assembler Developer
- 1.8K Basic
- 39.7K C and C++
- 4.2K C#
- 7.9K Delphi and Kylix
- 4 Haskell
- 9.6K Java
- 4.1K Pascal
- 1.3K Perl
- 1.9K PHP
- 505 Python
- 48 Ruby
- 4.3K VB.NET
- 1.6K VBA
- 20.8K Visual Basic
- 2.6K Game programming
- 309 Console programming
- 88 DirectX Game dev
- 1 Minecraft
- 108 Newbie Game Programmers
- 2 Oculus Rift
- 8.9K Applications
- 1.8K Computer Graphics
- 726 Computer Hardware
- 3.4K Database & SQL
- 520 Electronics development
- 1.6K Matlab
- 627 Sound & Music
- 254 XML Development
- 3.3K Classifieds
- 189 Co-operative Projects
- 175 For sale
- 189 FreeLance Software City
- 1.9K Jobs Available
- 598 Jobs Wanted
- 201 Wanted
- 2.9K Microsoft .NET
- 1.7K ASP.NET
- 1.1K .NET General
- 2.9K Miscellaneous
- 3 Join the Team
- 2 User Profiles
- 353 Comments on this site
- 58 Computer Emulators
- 1.8K General programming
- 137 New programming languages
- 596 Off topic board
- 161 Mobile & Wireless
- 35 Android
- 124 Palm Pilot
- 334 Multimedia
- 151 Demo programming
- 183 MP3 programming
- 0 Bash scripts
- 15 Cloud Computing
- 52 FreeBSD
- 1.7K LINUX programming
- 365 MS-DOS
- 0 Shell scripting
- 319 Windows CE & Pocket PC
- 4.1K Windows programming
- 879 Software Development
- 401 Algorithms
- 67 Object Orientation
- 84 Project Management
- 88 Quality & Testing
- 232 Security
- 7.5K WEB-Development
- 1.8K Active Server Pages
- 61 AJAX
- 2 Bootstrap Themes
- 55 CGI Development
- 19 ColdFusion
- 222 Flash development
- 1.4K HTML & WEB-Design
- 1.4K Internet Development
- 2.2K JavaScript
- 33 JQuery
- 283 WEB Servers
- 108 WEB-Services / SOAP

Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.

paa_vvu
Posts: **3**Member

in Algorithms

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

About & Contact / 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 LLC

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

## Comments

1Member:

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.

- Spam

0 · Vote Down Vote Up · Share on Facebook48Member[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]

- Spam

0 · Vote Down Vote Up · Share on Facebook10Member: [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

- Spam

0 · Vote Down Vote Up · Share on Facebook