Find the time complexity of the findNode() method from this code. | Sololearn: Learn to code for FREE!
New course! Every coder should learn Generative AI!
Try a free lesson
0

Find the time complexity of the findNode() method from this code.

Time complexity of an algorithm https://code.sololearn.com/cjmldlLPUlj5/?ref=app

c++linkedlistruntimealgorithmdatacomplexitystructuresbig-onotationdoublylinkedlist
19th Jan 2019, 5:50 AM
Sailesh Dahal
Sailesh Dahal - avatar
1 Answer
+ 1
It's O(n). The function is more complicated than necessary so may check each node up to 2 times. So it could be twice as fast in the worst case, but would still be O(n).
19th Jan 2019, 9:25 AM
Jared Bird
Jared Bird - avatar

Often have questions like this?

Learn more efficiently, for free:

See all courses
Hot today
Need suggestions what improvements can I do in it
3 Votes
Help me plss
0 Votes
Android studio emulator
0 Votes
I can't understand the problem , please help ...
1 Votes
Return function
1 Votes
Iam not able to add modules in python
0 Votes
[SOLVED] About split() Function
1 Votes
help me
0 Votes
Why does every time I try to change the variable into a flaot it doesn't work pls help me!
1 Votes
From code challenges
0 Votes