3.http://www.geeksforgeeks.org/analysis-of-algorithms-set-3asymptotic-notations/ 1 Answer 0votes TheBig-Onotation describes the performance of an algorithm in terms of number of elements in a data structure. Since Collection classes are actually data structures, we usually tend to use Big-O ...