Complexity and algorithms of functions

Question

I've seen many people asking for complexity of their own algorithms but is it possible to see the time/space complexity of all the functions (e.g string.indexof etc) in C# ? and if possible we could see the algorithm they implement???

if its possible, where can we find??

Nick Banks · Accepted Answer · 2011-01-21 05:54:27Z

1

Most built in functions are of what ever is the standard best case solutions to a problem. If you want any more information you may be able to find it on msdn.com. Otherwise you won't be able to see the microsoft code with out working there.

answered Jan 21, 2011 at 5:54

Nick Banks

4,4085 gold badges43 silver badges70 bronze badges

Sign up to request clarification or add additional context in comments.

1 Comment

Umer Over a year ago

i believe someone quoted the idea of reflection (why did he remove that :( )... that was a nice idea to look into MS code...

leppie · Accepted Answer · 2011-01-21 05:56:39Z

1

IIRC, the latest MSDN documentation includes method complexity for collection types.

answered Jan 21, 2011 at 5:56

leppie

118k18 gold badges201 silver badges300 bronze badges

2 Comments

leppie Over a year ago

Look in remarks section. msdn.microsoft.com/en-us/library/e4w08k17.aspx List<T>.IndexOf()

Umer Over a year ago

agreed, that's quite nice...but would have loved to see string.IndexOf(String).

Collectives™ on Stack Overflow

Complexity and algorithms of functions

2 Answers 2

1 Comment

2 Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

2 Answers 2

1 Comment

2 Comments

Your Answer

Sign up or log in

Post as a guest

Related