Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!feeder.erje.net!eu.feeder.erje.net!ecngs!feeder2.ecngs.de!feeds.phibee-telecom.net!newsfeed.xs4all.nl!newsfeed1.news.xs4all.nl!xs4all!newsgate.cistron.nl!newsgate.news.xs4all.nl!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.026 X-Spam-Evidence: '*H*': 0.95; '*S*': 0.00; 'table.': 0.07; 'dan': 0.09; 'cc:addr:python-list': 0.11; 'cc:name:python list': 0.16; 'tends': 0.16; 'wrote:': 0.18; 'cc:addr:python.org': 0.22; 'cc:2**0': 0.24; 'header:In-Reply-To:1': 0.27; 'message- id:@mail.gmail.com': 0.30; 'received:google.com': 0.35; 'there': 0.35; 'easily': 0.37; 'pm,': 0.38; 'mar': 0.68; 'beat': 0.68 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20120113; h=mime-version:in-reply-to:references:date:message-id:subject:from:to :cc:content-type; bh=ke+kzFpZ7KfuSw0Up3pWnj5XS3tS8/NN3AGxJizcum4=; b=S5tpKmoHw6F8mhrW4maacH4VUuiEO+ATGhE49px7pOwfYLUUwDGnqY6DegT+cK+sWd SrnMOQzBqhPnphf27fnSp9e+xyFcX2kO68Rza2xLTOP++Owi47ozZabU3bJIcDBgxv72 09ftJfSxVH3nHNQdp0j+TseiYEXN6ESJ4Fl5KeGzwtrOz0Lkdl4Ezqw8HOM80BSlotuM +Z3CTWDu0ioXE9Cb+7HGH67yqQh0wjdXtSg1Ay1b5KJJ1pLyIpYNZY4N9O2BeJaUF3v0 /j6ACzwctM92r7NSL1YrXaCnSEoBeartH0PGLmcENGEUfaQgKrL8M494ByV85jlOvlWM 73Dg== MIME-Version: 1.0 X-Received: by 10.236.7.47 with SMTP id 35mr16883284yho.23.1394401059604; Sun, 09 Mar 2014 14:37:39 -0700 (PDT) In-Reply-To: <87a9czrrax.fsf@elektro.pacujo.net> References: <87eh2d3x8h.fsf_-_@elektro.pacujo.net> <87eh2ctmht.fsf@elektro.pacujo.net> <87zjkz3eo3.fsf@elektro.pacujo.net> <87a9czrrax.fsf@elektro.pacujo.net> Date: Sun, 9 Mar 2014 14:37:39 -0700 Subject: Re: Balanced trees From: Dan Stromberg To: Marko Rauhamaa Content-Type: text/plain; charset=ISO-8859-1 Cc: Python List 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: 9 NNTP-Posting-Host: 2001:888:2000:d::a6 X-Trace: 1394401067 news.xs4all.nl 2847 [2001:888:2000:d::a6]:55438 X-Complaints-To: abuse@xs4all.nl Xref: csiph.com comp.lang.python:68094 On Sun, Mar 9, 2014 at 2:32 PM, Marko Rauhamaa wrote: > Dan Stromberg : > >> This is not just a detail: O(1) tends to be beat O(logn) pretty easily >> for large n. > > There is no O(1) hash table. http://stackoverflow.com/questions/2771368/can-hash-tables-really-be-o1