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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 14, 20262026-05-14T14:57:59+00:00 2026-05-14T14:57:59+00:00

Lets say we have a generic list of Class1, typically having ~100 objects for

  • 0

Lets say we have a generic list of Class1, typically having ~100 objects for a given session.
I would like to see if the list has a particular object. ASP.NET 2.0 allows me to do this:

Dim objResult as Class1 = objList.Find(objSearch)

How does this approach rate when compared to a traditional For loop, looking at a performance perspective?

How would this vary with increase or decrease in length of the list?

  • 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-14T14:58:00+00:00Added an answer on May 14, 2026 at 2:58 pm

    You can easily see how .Net List implements the Find method using Reflector:

    Public Function Find(ByVal match As Predicate(Of T)) As T
        If (match Is Nothing) Then
            ThrowHelper.ThrowArgumentNullException(ExceptionArgument.match)
        End If
        Dim i As Integer
        For i = 0 To Me._size - 1
            If match.Invoke(Me._items(i)) Then
                Return Me._items(i)
            End If
        Next i
        Return CType(Nothing, T)
    End Function
    

    The only difference between both implementations is that Find requires a call to match instead of having this logic inlined in the loop.

    Interestingly, this simple performance:

    var persons = new List<Person>();
    for (int i = 0; i < 100; i++)
    {
        persons.Add(new Person { ID = i });
    }
    
    GC.Collect();
    var sw = Stopwatch.StartNew();
    for (int i = 0; i < 10000000; i++)
    {
        persons.Find(person => person.ID == i % 100);
    
    }
    sw.Stop();
    Console.WriteLine(sw.Elapsed);
    
    GC.Collect();
    sw = Stopwatch.StartNew();
    for (int i = 0; i < 10000000; i++)
    {
        for (int j = 0; j < 100; j++)
        {
            if (persons[j].ID == i % 100)
            {
                break;
            }
        }
    }
    sw.Stop();
    Console.WriteLine(sw.Elapsed);
    

    Shows that:
    Total time required to query the list using Find is 05.7990078 seconds.
    Total time required to query the list using loop is 06.3551074 seconds.

    This results seems consistent in several executions.

    Edit – Found explanation for the advantage of Find:
    Find works faster since it accesses directly the underlying array in each iteration. The loop access it through the List indexer, which requires for every access index verification:

    Public Default Property Item(ByVal index As Integer) As T
        Get
            If (index >= Me._size) Then
                ThrowHelper.ThrowArgumentOutOfRangeException
            End If
            Return Me._items(index) // _items is the underlying array.
        End Get
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Lets say you have a relational DB table like INVENTORY_ITEM. It's generic in the
Lets say I have an array like this: string [] Filelist = ... I
Lets say we have something like: <div class=row> <div class=box> <a class=more href=#more/> </div>
Lets say, If I have a situation like the following. Type somethingType = b.GetType();
Which is your preference? Let's say we have a generic Product table that has
Lets say I have a Dictionary object: Dictionary myDictionary<int, SomeObject> = new Dictionary<string, SomeObject>();
Lets say I have the following code: abstract class Animal case class Dog(name:String) extends
Lets say I have several web sites on my web server, all as applications
Lets say I have a single object of type Car which I want to
Lets say I have a table in a sql server 2000 database called TransactionType:

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.