Design and Analysis of Algorithms - Old Questions

1.  What do you mean by complexity of an algorithm? Algorithm A has complexity O(2^logn) and algorithm B has time complexity O(log₂n) . Elaborate, how can you explain this statement.