0 votes 0 votes I didn't understand Big-O notation: This is CORMEN exercise problem - 3.1-2 Solution link: https://www.csee.umbc.edu/~nam1/TA/HWSols/hw1sol.pdf Algorithms algorithms asymptotic-notation + – Swapnil Naik asked Jul 23, 2018 Swapnil Naik 634 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Siddharth Bhardawaj commented Jul 24, 2018 reply Follow Share If you know the binomial theorem, you can easily understand. Just take an example with (a+b)$^{2}$ and visualise it from the given question. 0 votes 0 votes Swapnil Naik commented Jul 24, 2018 reply Follow Share Yes. You are correct, but I want to know in that big O method why there is (n-|a|)? 0 votes 0 votes Please log in or register to add a comment.