Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 3498370
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 18, 20262026-05-18T12:28:56+00:00 2026-05-18T12:28:56+00:00

What I wanted to do was to search in a list and remove a

  • 0

What I wanted to do was to search in a list and remove a value .

So I wrote the following code

for x in range(10):
   if x in list1:
      list1.remove(x)

Does this function of order ~ (n^2) since first it looks for the value and then it deletes and pushes the rest of the values backwards ??

Also is there a way to turn this in order n by using try/except

try:
  for x in range(10):
    list1.remove(x)
except ValueError:
  # make it go back to next iteration 
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-18T12:28:57+00:00Added an answer on May 18, 2026 at 12:28 pm

    This sounds like a job for filter():

    >>> filter(lambda x: not x in (4, 5, 7), xrange(10))
    [0, 1, 2, 3, 6, 8, 9]
    

    Update: one more example where I construct a list using list comprehension:

    >>> filter(lambda x: not x[0] in (4, 5, 7), [[a] for a in xrange(10)])
    [[0], [1], [2], [3], [6], [8], [9]]
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Possible Duplicate: Does std::list::remove method call destructor of each removed element? I have a
I was revisiting a piece of code I wrote to do combinatorial search a
I just got a list of requirements for a new search function for our
I wanted to implement a search feature for my web app. I choose Haystack
I'm creating video music search in android WebView and I wanted users can launch
Let's say you wanted to implement a breadth-first search of a binary tree recursively
I have tried to use mysql fulltext search in my intranet. I wanted to
Wanted to know if someone had a suggestion on code or maybe there's a
I wanted to search through multiple rows and obtain the row that contains a
I wanted to add user search auto-complete (like Facebook's) to my Rails app on

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.