# Single-Threaded CPU: Explained
Single-Threaded CPU shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Sort tasks by enqueue time. Hold available tasks in a min-heap of (processingTime, index). If the CPU is idle, jump time to the next enqueue; otherwise process the shortest available task and advance time by its duration.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (a heap or priority queue, Union-Find, interval scheduling, bitmask DP, a topological order, or a Trie) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n log n).
## Common mistake
Always taking the earliest-enqueued task, which ignores the "shortest processing time" rule.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at Linkjob.ai.