Welcome to the Lounge

harold aptroot wrote:

you get that

harold aptroot wrote:

is the familiar

harold aptroot wrote:

of course

public class SanderRossel : Lazy<Person>
{
   public void DoWork()
   {
      throw new NotSupportedException();
   }
}

Sander Rossel wrote:

O(3^2) = 9

Sander Rossel wrote:

That sorting a list with 9 elements takes 9 times as many steps as a list with 3 elements?

harold aptroot wrote:

[incomprehensible gibberish...]

public class SanderRossel : Lazy<Person>
{
   public void DoWork()
   {
      throw new NotSupportedException();
   }
}

harold aptroot wrote:

understand it without understanding it

harold aptroot wrote:

Want to know "which big O is better"? Just look it up in this small list:

O(1) < O(log n) < O(sqrt(n)) < O(n) < O(n log n) < O(n²) < O(n³) < O(2ⁿ)

public class SanderRossel : Lazy<Person>
{
   public void DoWork()
   {
      throw new NotSupportedException();
   }
}

Sander Rossel wrote:

take one out

PIEBALDconsult wrote:

Also, it might work for reading, but probably not for adding.

PIEBALDconsult wrote:

As long as you already have to know the structure/schema of the XML you might as well write specific classes to do that faster and safer.

Marc Clifton wrote:

Ugh, I guess there's no good answer, especially since I'm translating XML into DB transactions, and the XML schema and the database schema have really no similarities.