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 ?
Post your code.
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
I think you might benefit from reading some structured material on time complexity that would explain this to you.
Look up a C++ Reference and learn How To Ask Questions The Smart WayOriginally Posted by Bjarne Stroustrup (2000-10-14)
As you wish;
How could I analyze the time complexity? I don't know which code's rows can be neglected and which not in calculating the time complexity ... thank in advanceCode:Merge_Sort(A ,p, r) { if (p<r) q=(r+p)/2; Merge_Sort(A,p,q); Merge_Sort(A,q+1,r); Merge(A,p,q,r) // thats function is merging two arrays of size n }
Hi laserlight, I already have read the idea of time complexity but I'm not understanding when we can neglect time rather than the other time and vise versa ... as a result I posted here my thread in a hope to help!
thanks
Time complexity is a property ascribed to algorithms, not implementations.
Merge sort is Ο(n log n) regardless of how it is implemented.
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
