When you say runtimes, do you mean execution time? Based on your previous question, are you want to know things like a call to GetType() for example? If so, that would be difficult since the execution time of a function is dependent many things, least of which would be the hardware that it is running on and of course to the data passed to the function.
Of course for algorithms there is big-O notation (complexity) of the algorithm. Which can be used as a guideline to selecting the most appropriate algorithm for a specific problem. For example adding an item to a linked list is an O(1) operation, where searcing a linked list for an item is an O(n) operation where n relates to the number of items in the linked list, but a hash table lookup is again an O(1) operation etc. etc.