Computer Science · Data Structures and Algorithms
Counting Sort has time complexity O(K) + O(n) + O(K) + O(n) = O(n + K) and space complexity O(n + K), where n is the number of elements and K is the range of input values. Under which condition does Counting Sort achieve linear time and space complexity?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1K << log n
- 2K ≈ n✓
- 3Counting Sort is always linear regardless of K
- 4K >> n
Correct answer
K ≈ 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 Data Structures and Algorithms MCQs →Want more practice questions on Data Structures and Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures and Algorithms