Path: csiph.com!newsfeed.hal-mli.net!feeder3.hal-mli.net!newsfeed.hal-mli.net!feeder1.hal-mli.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.000 X-Spam-Evidence: '*H*': 1.00; '*S*': 0.00; 'skip:[ 20': 0.03; 'subject:skip:c 10': 0.07; '[1,': 0.09; 'collections': 0.09; 'indeed,': 0.09; 'cc:addr:python-list': 0.10; '-tkc': 0.16; 'distinct': 0.16; 'element.': 0.16; 'from:addr:python.list': 0.16; 'from:addr:tim.thechases.com': 0.16; 'from:name:tim chase': 0.16; 'it..': 0.16; 'iterating': 0.16; 'message-id:@tim.thechases.com': 0.16; 'received:70.251': 0.16; 'received:dsl.rcsntx.swbell.net': 0.16; 'received:rcsntx.swbell.net': 0.16; 'received:swbell.net': 0.16; 'subject:question.': 0.16; 'wrote:': 0.17; 'element': 0.17; '>>>': 0.18; 'import': 0.21; 'cc:2**0': 0.23; 'pass': 0.25; 'cc:addr:python.org': 0.25; 'header:In-Reply-To:1': 0.25; 'header :User-Agent:1': 0.26; 'gather': 0.29; 'except': 0.36; 'skip:{ 10': 0.36; "didn't": 0.36; 'should': 0.36; 'subject:: ': 0.38; 'think': 0.40; "you've": 0.61; 'gone': 0.64; 'making': 0.64; 'results': 0.65; 'received:50.22': 0.84 Date: Sat, 29 Dec 2012 18:26:37 -0600 From: Tim Chase User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:17.0) Gecko/17.0 Thunderbird/17.0 MIME-Version: 1.0 To: Mitya Sirenef Subject: Re: dict comprehension question. References: <724d4fea-606a-4503-b538-87442f6bcebc@ci3g2000vbb.googlegroups.com> <50DF4C00.2020505@lightbird.net> <50DF4E15.1030700@lightbird.net> <50DF6334.7050600@lightbird.net> In-Reply-To: <50DF6334.7050600@lightbird.net> Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit X-AntiAbuse: This header was added to track abuse, please include it with any abuse report X-AntiAbuse: Primary Hostname - boston.accountservergroup.com X-AntiAbuse: Original Domain - python.org X-AntiAbuse: Originator/Caller UID/GID - [47 12] / [47 12] X-AntiAbuse: Sender Address Domain - tim.thechases.com Cc: "python-list@python.org" 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: 27 NNTP-Posting-Host: 2001:888:2000:d::a6 X-Trace: 1356827130 news.xs4all.nl 6841 [2001:888:2000:d::a6]:33069 X-Complaints-To: abuse@xs4all.nl Xref: csiph.com comp.lang.python:35793 On 12/29/12 15:40, Mitya Sirenef wrote: >> >>> w = [1,2,3,1,2,4,4,5,6,1] >> >>> s = set(w) >> >>> s >> set([1, 2, 3, 4, 5, 6]) >> >>> {x:w.count(x) for x in s} >> {1: 3, 2: 2, 3: 1, 4: 2, 5: 1, 6: 1} > > Indeed, this is much better -- I didn't think of it.. Except that you're still overwhelmed by iterating over every element in "w" for every distinct element. So you've gone from O(N**2) to O(k*N). The cleanest way to write it (IMHO) is MRAB's >>> w = [1, 2, 3, 1, 2, 4, 4, 5, 6, 1] >>> from collections import Counter >>> results = dict(Counter(w)) which should gather all the statistics in one single pass across "w" making it O(N), and it's Pythonically readable. -tkc