1/5
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai |
|---|
No analytics yet
Send a link to your students to track their progress
What does it mean when an Algorithm is Stable?
when all the elements are arranged in the same relative order as they appear in the input
What does it mean when an Algorithm is In Place?
only a constant number of elements of the input array are ever stored outside of the array at any given time
How do Divide and Conquer Algorithms work?
breaking down the problem into smaller independent sub-problems,
solving the sub-problems recursively, and
combining the solutions of the sub-problems to construct the solution to the original problem
What is the Master Theorem?
f(n) is the cost of combining solutions of the smaller sub-problems in the recursive calls

What are the differences between Merge Sort and Quicksort?

What do we mean by "Solving the Recurrence Relation"?
