Python solutions to https://github.com/karan/Projects
This repo is mainly for learning purposes and just for fun.
Below is a list of projects that I've implemented and links to the solutions.
Collatz Conjecture – Start with a number n > 1. Find the number of steps it takes to reach one using the following process: If n is even, divide it by 2. If n is odd, multiply it by 3 and add 1.
Sieve of Eratosthenes – The sieve of Eratosthenes is one of the most efficient ways to find all of the smaller primes (below 10 million or so).
Find PI to the Nth Digit – Enter a number and have the program generate PI up to that many decimal places. Keep a limit to how far the program will go.
Fetch Current Weather – Get the current weather for a given zip/postal code.