Analysis of Algorithms CS 224
0.0(0)
Studied by 0 people
Call Kai
Learn
Practice Test
Spaced Repetition
Match
Flashcards
Knowt PlayCard Sorting
1/6
There's no tags or description
Looks like no tags are added yet.
Last updated 4:10 PM on 9/3/26
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai | Chat |
|---|
No analytics yet
Send a link to your students to track their progress
7 Terms
1
New cards
Algorithm Efficiency
_______ is expressed in terms of CPU time.
2
New cards
The analysis of algorithms
________ involves categorizing an algorithm in terms of efficiency.
3
New cards
Time complexity
CPU time
4
New cards
Space complexity
memory space
5
New cards
Growth functions
A _________ shows the relationship between the size of the problem (n) and the value optimized (time). The main focus is CPU time.
6
New cards
Asymptotic Complexity
______ is based on the dominant term of the growth function. The term that increases the most
quickly as n increases. t(n) = 15n^2 + 45n
7
New cards
Big-O Notation
The coefficients and the lower-order terms become increasingly less relevant as n increases.