0

Just what the question asks. Its a question for my midterm tomorrow and I cant seem to find the answer anywhere online or in my textbook. Thanks for the Help!!

Ryan_lx
  • 13
  • 4

1 Answers1

1

It means that the algorithm's complexity only depend on the size of the input data, not its content.

Vincent Cantin
  • 16,192
  • 2
  • 35
  • 57
  • Thank You!! I've been trying to wrap my head around this. – Ryan_lx Feb 21 '14 at 06:42
  • I am only answering what I think, I can't be sure that it is THE answer you need. I recommend you to double check with your peers. – Vincent Cantin Feb 21 '14 at 08:35
  • 1
    @Vincent: Consider an algorithm for finding the average of an array of integers. For an array of n items, that's always going to take the same time regardless of the contents of the array. So the upper and lower bounds are the same. Contrast that will sequential search, which could take 1 iteration (the item is in the first position), or could take n iterations (the item is at the end of the array). Or comparison sorting, which is very dependent on the order of items. – Jim Mischel Feb 21 '14 at 14:23
  • Thanks Jim,to validate the answer. – Vincent Cantin Feb 24 '14 at 02:53