7-Modern-Languages-in-7-Weeks---Systems--Security---Algorithms-Track/week 1/day 5/day5.md

if the number of user dobules

the time of execution will be multiply by 2

T(n, m) = n \times m
T(2n, m) = 2 \times n \times m
Big-O: O(n·m)