what do you mean by complexity of a algorithm in layman's term. How can one find it? asked 15 Mar '15, 00:25

total expense per operation, evaluated over a sequence of operations. answered 15 Mar '15, 02:02

This is known as the BigO notation. Briefly: Basically any 'O' notation means an operation will take time up to a maximum of k*f(N)
where: Quick Explanation: 2) O(N^{2}) means that for every insert, it takes N^{2} operations. i.e. 1 operation for 1 item, 4 operations for 2 items, 9 operations for 3 items and so on. Other Links : Read here for further explanation. answered 15 Mar '15, 03:32
