This is the second part of a series on how to deploy a Django app on Heroku. If you haven’t looked at the first part, you might want to do it now. Go to How to deploy a Django app on Heroku. Part I. You will see that the main idea behind these posts is not…
Month: December 2013
How to deploy a Django app on Heroku. Part I
This post is the first post of a series on how to deploy a Django project on Heroku. You will see that the main idea behind these posts is not to build a functional Django app. Instead, what I want to do is to give you a bunch of good practices on how to build…
Python recursive function to find the nth Fibonacci number
Today, a short post with a Python recursive function that finds the nth Fibonacci number. Marina MeleMarina Mele has experience in artificial intelligence implementation and has led tech teams for over a decade. On her personal blog (marinamele.com), she writes about personal growth, family values, AI, and other topics she’s passionate about. Marina also publishes…
Setting IPython on Mac OS X, Mountain Lion
This post describes how to install IPython on a Mac OS X, Mountain Lion. Step by step, it explains how to install Python, Homebrew, Virtualenv, IPython, IPython Notebook and some useful libraries like Matplotlib. Marina MeleMarina Mele has experience in artificial intelligence implementation and has led tech teams for over a decade. On her personal…
Python scripts for prime numbers and divisors
Very recently I been interested in solving the problems proposed by Project Euler. Currently I just solved about 20 problems, but I run into some nice algorithms for finding prime numbers and divisors that I would like to share.
This first snippet defines a function that returns a list of the prime numbers up to a given integer. It uses the Sieve of Atkin, which is a modern algorithm that optimizes the Sieve of Eratosthenes.