ShmoopTube

AP Computer Science 1.4 Standard Algorithms. How many times will mystery be called for mystery(n) for n > 1?

AP Computer Science 2.4 Standard Algorithms. What is the quickest possible combination of search and sort methods to find a single sheep, shear him...

AP Computer Science 3.1 Standard Algorithms. What is the output of Recurse(3)?

AP Computer Science 3.2 Standard Algorithms. What is the worst case for insertion sort?

AP Computer Science: Standard Algorithms Drill 3, Problem 3. What should go in "expression 1" to satisfy the conditional statement?

AP Computer Science 4.2 Standard Algorithms. What kind of algorithm is the following?

AP Computer Science 4.3 Standard Algorithms. What kind of algorithm is Shmystery?

AP Computer Science 1.1 Standard Algorithms Drill 1, Problem 1. What is the output of Recurse(3)?

AP Computer Science 1.2 Standard Algorithms. What is the output of Recurse(5)?

AP Computer Science 1.3 Standard Algorithms. How many times will mystery be called for mystery(4), including the initial call?

AP Computer Science 1.5 Standard Algorithms. What is the output of mystery(4)?

APCS: Standard Algorithms Drill 2, Problem 1. How much slower is InefficientSum than EfficientSum in the best case for an array of n elements?

In this computer science drill question, figure out which implementation will copy one array over to another.

AP Computer Science: Drill 3, Problem 4. What should go in "expression 2" to complete the method?

AP Computer Science 4.1 Standard Algorithms. How much slower is InefficiantSum than EfficientSum in the best case for an array of n elements?

AP Computer Science 4.5 Standard Algorithms. Which of the following implementations successfully copies over array myalph to ArrayList alphabet?