title: Test an hypothesis significantly
body: <p>How can I test the hypothesis that the execution time of an 
  algorithm is not exponentially, with respect to the size of the data.</p>
  
  <p>For exaple, I have the sample:</p>
  
  <p>[n time(s)] = {[02 0.36], [03 1.15], [04 2.66], [05 5.48], [06 6.54], [07 11.22], [08 12.87], [09 16.94], [10 17.59]}</p>
  
  <p>where n is the size of the data. I want to proof significantly that the time does not grow exponentially with respect to the data.</p>
  
  <p>What should be the hypotheses H0, H1.</p>
  
  <p>Should I use anova or f-test? How do I apply it?</p>
  
  <p>Thanks.</p>