Programming Forums
User Name Password Register
 

RSS Feed
FORUM INDEX | TODAY'S POSTS | UNANSWERED THREADS | ADVANCED SEARCH

 
 
Thread Tools Display Modes
Prev Previous Post in Thread   Next Post in Thread Next
Old Oct 27th, 2005, 4:21 PM   #1
victor_shade
Newbie
 
Join Date: Oct 2005
Posts: 3
Rep Power: 0 victor_shade is on a distinguished road
finding primes in an array

I need help writting code that returns primes in an array, one method that returns the nth prime number

int getNthPrimeNumber(int n ){



}


and a second that returns the number of prime numbers less than or equal to n

int getNumberPrimeNumbers(int n) {

}


thanks in advance for the help
victor_shade is offline   Reply With Quote
 

Bookmarks

« Previous Thread in Forum | Next Thread in Forum »

Currently Active Users Viewing This Thread: 1 (0 members and 1 guests)
 
Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Forum Jump




DaniWeb IT Discussion Community
All times are GMT -5. The time now is 11:53 AM.

Powered by vBulletin® Version 3.7.0, Copyright ©2000 - 2008, Jelsoft Enterprises Ltd.
Copyright ©2007 DaniWeb® LLC