Algorithmic Efficiency
AP Computer Science Principles · Flashcards
AP COMPUTER SCIENCE PRINCIPLES · FLASHCARDS
Card 1
of 39
0 got it
0 to review
Current
Got it
Still learning
Not seen
QUESTION
Identify the time complexity of Kruskal's algorithm.
QUESTION
What is the Big O notation for an algorithm with constant time?
QUESTION
What is the time complexity of heap sort?
Tap to flip before you grade
ANSWER
O
(
n
log
n
)
O(n \text{ log } n)
O
(
n
log
n
)
. Maintains heap property through logarithmic operations.
Swipe → got it · swipe ← still learning
Got it
Still learning
Flip Card
Previous card
Next card