While programming to find the largest prime factor for a composite number i came across a problem that if the number taken as input exceeds a certain limit, the loop time turns out to be a very long one and some times even resembling the time taken by an infinite loop.The method used for finding the prime factors is a standard one in which we loop through natural number until the input equals the loop counter; finding its factors and then checking for it to be prime or not ;through another function by a similar method using a counter variable.? Alternatives for drastic time reduction ?(adsbygoogle = window.adsbygoogle || []).push({});

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Pyhton data's structural size and loop efficiency

Loading...

Similar Threads - Pyhton data's structural | Date |
---|---|

Python Interesting article how to use Pandas with Excel sheets | Feb 19, 2018 |

Python Projects involving data science | Jan 8, 2018 |

Bash shell scripting and data science | Jan 2, 2018 |

Rapid data retrieval from Excel (or similar) | Dec 26, 2017 |

Data Structure | Sep 18, 2016 |

**Physics Forums - The Fusion of Science and Community**