AI for meeting notes and action items in AI for Everyone - Time & Space Complexity
When AI listens to meetings and creates notes or action items, it processes spoken words to find important points.
We want to understand how the time it takes grows as the meeting gets longer or more complex.
Analyze the time complexity of the following AI process for meeting notes.
function processMeeting(transcript) {
let notes = [];
for (let sentence of transcript) {
if (isImportant(sentence)) {
notes.push(extractActionItems(sentence));
}
}
return notes;
}
This code goes through each sentence in the meeting transcript, checks if it is important, and if so, extracts action items.
Look for repeated steps that take most time.
- Primary operation: Looping through each sentence in the transcript.
- How many times: Once for every sentence in the meeting.
As the meeting transcript gets longer, the AI checks more sentences.
| Input Size (n) | Approx. Operations |
|---|---|
| 10 sentences | About 10 checks |
| 100 sentences | About 100 checks |
| 1000 sentences | About 1000 checks |
Pattern observation: The work grows directly with the number of sentences; double the sentences, double the work.
Time Complexity: O(n)
This means the AI's processing time grows in a straight line with the meeting length.
[X] Wrong: "The AI only needs to check a few sentences, so time stays the same no matter how long the meeting is."
[OK] Correct: The AI actually looks at every sentence to find important points, so more sentences mean more work.
Understanding how AI processes grow with input size helps you explain efficiency clearly and confidently in real-world discussions.
"What if the AI also compared each sentence to every other sentence to find duplicates? How would the time complexity change?"