GkSeries.com
Home
GK
ENGLISH
CURRENT AFFAIRS
APTITUDE
REASONING
BANKING
UGC NET
COMPUTER SC.
UPSC Prelims
COURSES
Home
Computer Science
the complexity of merge sort algorithm is
The complexity of merge sort algorithm is
A
O(n)
B
O(log n)
C
O(n2)
D
O(n log n)
Answer & Explanation
Option: [D]
⭐ Make GKSeries Your Preferred Source on Google
Add GKSeries as Preferred Source
Next Question →
WhatsApp
Facebook
Telegram
Pinterest
Copy Link
Connect with Us
Follow
Follow
Follow
Join channel
Join channel
Follow