Linear Algorithm O(N) Constant time(์์ ์๊ฐ) O(1) public void print_first(arr){ System.out.println(arr[0]) } It doesn't matter how big the input is this function will tate the same amout of steps to finish. Quadratic Time (์ ๊ณฑ๊ทผ) O(n^2) public void print_twice(arr){ for(int n: arr){ for(int x: arr){ print(x, n); } } } Logarithmic Time (log) O(log n) ex) binary search Logarithm is the opposite of..