How to find size of a function in c?

Question

Given an unordered array A of size n and integer x. What is the best complexity to find two elements in A whose sum is x?
Share the algo, its complexity and if possible C code.

Answer 1

There is a way to determine the size of a function. The command is:

nm -S "object_file_name"

This will return the sizes of each function inside the object file. Consult the manual pages in the GNU using 'man nm' to gather more information on this.

Comments

Hi Aarti,
Is there a way to achieve the same using programming?(Not through command line). Maybe with the help of some dummy function logic or subtracting the addresses of 2 functions?