Path: csiph.com!usenet.pasdenom.info!dedibox.gegeweb.org!gegeweb.eu!nntpfeed.proxad.net!proxad.net!feeder1-2.proxad.net!usenet-fr.net!nerim.net!novso.com!newsfeed.xs4all.nl!newsfeed4.news.xs4all.nl!xs4all!post.news.xs4all.nl!not-for-mail Return-Path: X-Original-To: python-list@python.org Delivered-To: python-list@mail.python.org X-Spam-Status: OK 0.029 X-Spam-Evidence: '*H*': 0.94; '*S*': 0.00; 'else:': 0.03; 'subject:Python': 0.05; 'def': 0.10; "wouldn't": 0.11; 'purposes.': 0.16; 'subject:3.3': 0.16; 'table))': 0.16; 'wrote:': 0.17; 'certainly': 0.17; 'tim': 0.18; '>>>': 0.18; 'feb': 0.19; "i'd": 0.22; 'header:In-Reply-To:1': 0.25; 'am,': 0.27; 'message- id:@mail.gmail.com': 0.27; 'seconds': 0.30; 'could': 0.32; 'to:addr:python-list': 0.33; 'received:google.com': 0.34; 'received:209.85.220': 0.35; 'table': 0.35; 'received:209.85': 0.35; 'but': 0.36; 'enough': 0.36; 'received:209': 0.37; 'subject:: ': 0.38; 'sure': 0.38; 'to:addr:python.org': 0.39; 'your': 0.60; 'most': 0.61; 'share': 0.61; 'subject:. ': 0.66; 'further,': 0.71; '2013': 0.84; 'subject:Basic': 0.84; 'to:name:python': 0.84 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20120113; h=x-received:mime-version:in-reply-to:references:from:date:message-id :subject:to:content-type; bh=/1QF3pDlDtUvTjRsN4oZgaS4OkksN23VfUIpye0e0LA=; b=ZWgoxyuolSxaylj/uN6OWtrRjwAjJy/aZ2FWwAC5rf2bWYlmsmnKFfv5V226gnmYpu xhF38gjAu03VNTwoLdzfG1uH5LEcT/e9KAR+7TiH4STlHOIjvnQB3p3xSgGEfxIqBC/P vvs9W5nN8iuEu/jGfXoxmQfGdheoiTfYLqDJLzF+YKEwfbfES5bADbYcuv6PYeAvApvt QK00ClkJdlssdBZgM9EBzhugpbbvuZAytg26HKntlaUPsLEjluQhtsxMg0/GMq3PHQrx 61W2G+pPRaAvirhUSHiSLmbmZJ1U6XVOHJuBQK8++myXJdpQiNEgJEtK288E4Q7VGfKM G1Zw== X-Received: by 10.68.245.201 with SMTP id xq9mr42471845pbc.160.1361298725804; Tue, 19 Feb 2013 10:32:05 -0800 (PST) MIME-Version: 1.0 In-Reply-To: References: From: Ian Kelly Date: Tue, 19 Feb 2013 11:31:24 -0700 Subject: Re: Python 3.3 vs. MSDOS Basic To: Python Content-Type: text/plain; charset=ISO-8859-1 X-BeenThere: python-list@python.org X-Mailman-Version: 2.1.15 Precedence: list List-Id: General discussion list for the Python programming language List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Newsgroups: comp.lang.python Message-ID: Lines: 25 NNTP-Posting-Host: 2001:888:2000:d::a6 X-Trace: 1361298729 news.xs4all.nl 6904 [2001:888:2000:d::a6]:40268 X-Complaints-To: abuse@xs4all.nl Xref: csiph.com comp.lang.python:39269 On Tue, Feb 19, 2013 at 7:46 AM, Tim Daneliuk wrote: > Are you sure you wouldn't like to share with the class? I'd be interested > in seeing your approach... Very well: def collatz(n, memo): if n not in memo: if n % 2 == 0: next_n = n // 2 else: next_n = 3 * n + 1 memo[n] = collatz(next_n, memo) + 1 return memo[n] def run_collatz(upper): table = {1: 0} max_n = max(range(1, upper), key=lambda n: collatz(n, table)) return max_n, table[max_n] >>> run_collatz(1000000) (837799, 524) It could certainly be optimized further, but at about 4 seconds it's already fast enough for most purposes.