Algorithm for extracting the prime factors of an integer

[William Park]

Luca Bruderer <luca.bruderer at bluewin.ch> wrote:
> 
> "William Park" <opengeometry at yahoo.ca> schrieb im Newsbeitrag
> news:aul4av$7g4po$1 at ID-99293.news.dfncis.de...
>> Luca Bruderer <luca.bruderer at bluewin.ch> wrote:
>> > Hi
>> >
>> > I'm wondering which is the best algorithm to do this.
>>
>> Brute-force method.  Just keep on dividing by the prime numbers until
>> you get to 1. :-)
> 
> That was my idea too, but then you need a list of the prime numbers.

http://primes.utm.edu/links/lists_of_primes/small_primes/first_n_primes/
http://groups.google.com/groups?q="prime+numbers"&scoring=d&num=100

-- 
William Park, Open Geometry Consulting, <opengeometry at yahoo.ca>
Linux solution for data management and processing.