Algorithms with a triply-nested loop are typically cubic–their time-complexity functions are specified in terms of n 3. This pattern continues with quadruply and higher nested loops.

This approach performs faster than the nested loop algorithm for all but the smallest of Lists, and when the Lists are small the difference in speed is negligible. Deduping Lists in Java. There are a ...