Question

The Euler’s circuit problem can be solved in?

(a) O(N)

(b) O( N log N)

(c) O(log N)

(d) O(N^2)

I have been asked this question in an interview for job.

I'd like to ask this question from Checksum, Complexity Classes & NP Complete Problems in division Checksum, Complexity Classes & NP Complete Problems of Data Structures & Algorithms II

Answer 1

The correct choice is (d) O(N^2)

Easiest explanation - Mathematically, the run time of Euler’s circuit problem is determined to be O(N^2).