You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
notes/classes/algorithms/measuring_combinations_of_f...

541 B

Big O Combinations of Functions

$$ f1+f2 = O(max(|f1|,|f2|)) $$ When we do 2 things in sequence, it is represented with f1+f2, and the big_o_notation is simply which ever the most complex of the two functions is

$$ f1f2 = O(f1f2) $$ When we encounter a situation like nested loops, this can be represented as the multiplied value of the two functions, meaning if we get 2 functions of n value, the big_o_notation is O(n²)

see also

list without id file.inlinks
where file.name = this.file.name