Question: what is big o java?
Answer: Big O Notation is a relative representation of an algorithm's complexity. It describes how an algorithm performs and scales by denoting an upper bound of its growth rate. ... It describes the upper bound of the growth rate of a function and could be thought of the worst case scenario.