Hi guys, I'm just wondering when we are neglecting time complexity of something and when not? to clear more about an example, lets say I have a merge_sort recursively, when calling in this pattern Merge_Sort(Array A, q+p, r) which q is median and p,r are bounds of the array .. we are neglecting the consume time of argument q+p while adding .. why?! and when we are neglecting like these things and when not ?
