Computer Science · Data Structures
एक शुरुआत में खाली लिंक की गई सूची में 'n' तत्वों को सम्मिलित करने की सबसे खराब स्थिति (worst-case) समय जटिलता क्या है ताकि लिंक की गई सूची को सॉर्ट किए गए क्रम में बनाए रखा जा सके?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Θ(n)
- 2Θ(n2)✓
- 3Θ(1)
- 4Θ(n log n)
सही उत्तर देखें
Θ(n2)
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 Data Structures MCQs →Want more practice questions on Data Structures?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures