Computer Science · Algorithms
निम्नलिखित कोड स्निपेट पर विचार करें जो इनपुट के रूप में एक सकारात्मक पूर्णांक n स्वीकार करता है: int i = 0, j = 0, val = 1; for (i = 1; i 1) { val = val * j; j = j / 2; } } } इस एल्गोरिथम की वर्स्ट-केस (worst-case) समय जटिलता (time complexity) क्या है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1O(n2 log n)
- 2O(n2)
- 3O(n log n)✓
- 4O(n)
सही उत्तर देखें
O(n log n)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Algorithms MCQs →Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms