Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!feeder.erje.net!eu.feeder.erje.net!news.stack.nl!newsfeed.xs4all.nl!newsfeed1.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.011 X-Spam-Evidence: '*H*': 0.98; '*S*': 0.00; "subject:' ": 0.07; 'subject:help': 0.08; 'logic': 0.09; 'subject:using': 0.09; 'thats': 0.09; 'expecting': 0.16; 'from:addr:rosuav': 0.16; 'from:name:chris angelico': 0.16; 'subject: \n ': 0.16; 'subject:python': 0.16; 'sat,': 0.16; 'wrote:': 0.18; 'help.': 0.21; 'satisfying': 0.24; 'header:In-Reply-To:1': 0.27; 'subject:list': 0.30; 'message-id:@mail.gmail.com': 0.30; '25,': 0.31; 'steven': 0.31; 'but': 0.35; 'received:google.com': 0.35; 'done': 0.36; 'method': 0.36; 'similar': 0.36; 'should': 0.36; 'to:addr:python-list': 0.38; 'pm,': 0.38; 'to:addr:python.org': 0.39; 'solve': 0.60; 'finally': 0.65; 'yourself,': 0.95; '2013': 0.98 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 :content-type; bh=EUnSrzc0dI73vR74Hqp9bW6IYA+9AU/CILzMa4kJmjQ=; b=aXAXom7i/zc8laxBbcyaL06iIKoqeejrhleycRPetN3PZmEz762eSE39/W0sswYP/E G+EkGWuEjpqfpg/vHze3xDLE68sgCwiYcrx1XqO/CTYQhAHisiCbPAkGnU66GNxrBAnf /HM1kvr8l+GfjNvfLqXn4jtgK31ibEMdnJs1TpxN6/nuLmgvf8Qc7OdrYqgItFBvNf+e MVWRLSdT6v3l1biOpl7bsTvbYWyZ3LhS9pFmkTqVClJhBXyClqCrJqnm3WSZLV/XnWdz 9RofOiN77fP9TQU/A3KImkikPziEvAusPimM4CgYVB2kfsbVzguhriNVPEdI/yMzTwKy J0RQ== MIME-Version: 1.0 X-Received: by 10.220.109.66 with SMTP id i2mr10471874vcp.51.1369462344251; Fri, 24 May 2013 23:12:24 -0700 (PDT) In-Reply-To: <74e33270-a79a-4878-a400-8a6cda6637b2@googlegroups.com> References: <78192328-b31b-49d9-9cd6-ec742c092a29@googlegroups.com> <39ac7437-857e-483f-998c-8162c1039933@googlegroups.com> <51a052d1$0$6599$c3e8da3$5496439d@news.astraweb.com> <74e33270-a79a-4878-a400-8a6cda6637b2@googlegroups.com> Date: Sat, 25 May 2013 16:12:24 +1000 Subject: Re: help how to sort a list in order of 'n' in python without using inbuilt functions?? From: Chris Angelico To: python-list@python.org 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: 12 NNTP-Posting-Host: 2001:888:2000:d::a6 X-Trace: 1369462347 news.xs4all.nl 15873 [2001:888:2000:d::a6]:48143 X-Complaints-To: abuse@xs4all.nl Xref: csiph.com comp.lang.python:45971 On Sat, May 25, 2013 at 4:05 PM, wrote: > ya steven i had done the similar logic but thats not satisfying my professor > he had given the following constrains > 1. No in-built functions should be used > 2. we are expecting a O(n) solution > 3. Don't use count method And now you finally admit that it's homework. Solve it yourself, or go to your prof and say that you need help. ChrisA