I'm a non-CS grad student working on an algorithm which would be an alternative to conventional GPS position estimation algorithms. My advisor insists that I must compare the run-time of these algorithms. I understand that simply timing the two algorithms is not a good measure for comparison for several reasons but I'm having trouble finding a good way to compare them.
I am familiar with big-O notation, but my understanding is that it is a good measure for understanding how an algorithm scales as the size of the input approaches infinity. For GPS problems, the size of the input depends on the number of available satellites which is obviously finite (probably never larger than 25 or so).
For such a scenario what would be the best way to compare efficiency?