Skip to main content
Computer Science

Return to Question

edited body; edited tags; edited title
Source Link
Raphael
Raphael
  • 72.9k
  • 30
  • 181
  • 393

Why use comparisons instead of runtime for comparing two algorithms?

I notice that in a few CS research paperpapers, to compare the efficiency of two algorithms, the total number of key comparison in the algorithms is used rather than the real computing times themselves. Why we can't we compare which one is better by running the both programs and countcounting the total time needed to run the algorithms?

comparing two algorithms

I notice that in a few CS research paper, to compare the efficiency of two algorithms, the total number of key comparison in the algorithms is used rather than the real computing times themselves. Why we can't compare which one is better by running the both programs and count the total time needed to run the algorithms?

Why use comparisons instead of runtime for comparing two algorithms?

I notice that in a few CS research papers, to compare the efficiency of two algorithms, the total number of key comparison in the algorithms is used rather than the real computing times themselves. Why can't we compare which one is better by running both programs and counting the total time needed to run the algorithms?

Tweeted twitter.com/#!/StackCompSci/status/234437414347751424
Source Link
has
has
  • 361
  • 2
  • 5

comparing two algorithms

I notice that in a few CS research paper, to compare the efficiency of two algorithms, the total number of key comparison in the algorithms is used rather than the real computing times themselves. Why we can't compare which one is better by running the both programs and count the total time needed to run the algorithms?