search
Log In
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Sep 2019
  1. Satbir

    567 Points

  2. Bikram

    566 Points

  3. GAITONDE

    348 Points

  4. Vimal Patel

    87 Points

  5. Shaik Masthan

    38 Points

  6. BLACK_CLOUD

    14 Points

  7. sekhar_1621

    13 Points

  8. OgbeborBeatrice

    13 Points

  9. RAMYA.F

    9 Points

  10. vkw1111

    9 Points

0 votes
2 views
Suppose someone designs a new airline routing algorithm called MagicPath and claims that its worst-case complexity is O(n^2 log n). Which of the following statements is inconsistent with this claim.

 For every n, for every input of size n, MagicPath is able to solve the problem in time proportional to n^2.

 For some n, for every input of size n, MagicPath is able to solve the problem in time proportional to n^2.

 For every sufficiently large n, there is an input of size n for which MagicPath requires time proportional to n^2.

 For every sufficiently large n, there is an input of size n for which MagicPath requires time proportional to n^3.
in Algorithms 6 points 2 views

Please log in or register to answer this question.

...