>_
SWE Maxx
Questions
Quizzes
Daily challenge
System design
My attempts
Sign in
☀
☾
Light mode
Dark mode
Loading question…
Sign in
← Question bank
Algorithms · Multiple Choice
Difficulty: Easy
What is the time complexity of two consecutive full scans of an n-element array?
Complexity reasoning
Asymptotic analysis
Choose your answer
A
O(n log n)
B
O(1)
C
O(n)
D
O(n²)
Check answer
More in Algorithms →
What is the time complexity of two consecutive full scans of an n-element array? | SWE Maxx