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 143451
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 11, 20262026-05-11T08:05:51+00:00 2026-05-11T08:05:51+00:00

What is the most efficient way to remove alternate (odd indexed or even indexed)

  • 0

What is the most efficient way to remove alternate (odd indexed or even indexed) elements in an List<T> without using a place holder list variable?

Also it would be appreciated if you could mention the cost with each of your answer.

I’m looking for an efficient way to do this

Thanks in advance

  • 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. 2026-05-11T08:05:51+00:00Added an answer on May 11, 2026 at 8:05 am

    If you call RemoveAt for every item you remove, you will be moving a lot of data. The most efficient is to move the items together that you want to keep, then remove the unused items at the end:

    int pos = 0; for (int i = 0; i < values.Count; i += 2, pos++) {     values[pos] = values[i]; } values.RemoveRange(pos, values.Count - pos); 

    Edit:
    This method will process a list of a million ints in 15 ms. Using RemoveAt it will take over three minutes…

    Edit2:
    You could actually start with pos=1 and i=2 (or 3), as the first item doesn’t have to be copied to itself. This makes the code a bit less obvious though.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I'm having issues finding the most efficient way to remove duplicates from a list
(Without including any external libraries.) What's the most efficient way to remove the extension
List item What's the most efficient way to remove items from an array in
What's the most efficient way to resize large images in PHP? I'm currently using
What is the most efficient way of turning the list of values of a
What's the most efficient way to remove the text 2010-04-07 14:25:50,773 DEBUG This is
What is the easiest and most efficient way to remove spaces from a string
I'm looking for some ideas for the most efficient way to remove trailing html
What is the most memory efficient way to remove duplicate lines in a large
What is the most efficient way to remove accents from a string e.g. ÈâuÑ

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.