title: How dominant term helps determine time complexity using Big-O?
body: <p>I don't quite understand the concept of dominant terms and how to determine the time complexity using big o. Like, for example, the dominant term of          N(100N + 200N^3) + N^3. If anyone could explain it, that would be very helpful.</p>