An algorithm has two phases. The first phase, initialization, takes time O(n2 log n). The second phase, which is the main computation, takes time O(n3). What is the most accurate description of the complexity of the overall algorithm?
- O(n2 log n)
- O(n3)
- O(n3 log n)
- O(n3 + log n)
Im getting option 2 , is it correct ?