Asymptotic notation of algorithms: memo

Algorithm complexity Definition The growth rate big O T(x)=O(g(x)) The growth rate of f(x) is asymptotically less than or equal to (<=) the growth rate of g(x) little o T(x)=o(g(x)) The growth rate of f(x) is asymptotically less than (<) the

Five programming problems every Software Engineer should be able to solve in less than 1 hour

I have found an interesting post about interviewing recently. Actually, I don’t really like this categorical approach. But there are my solutions have been written in Ruby. Problem 1 Write three functions that compute the sum of the numbers in a given list using a for-loop, a while-loop, and