How can I figure out the time complexity of a program?

The program is of the Travelling Salesman Problem. The aim was to implement the problem in two ways - Dynamic programming vs Simulated Annealing.

Now I have to compare the two codes, find out which is faster and give the time complexity.

Any suggestions?