Suppose that the splits at every level of quicksort are in the proportion 1 − α to α where 0 < α ≤ 1/2 is a constant. Show that the minimum depth of a leaf in the recursion tree is approximately

Explanation:

The minimum depth occurs for the path that always takes the smaller portion of the

split, i.e., the nodes that takes α proportion of work from the parent node. The first

node in the path(after the root) gets α proportion of the work(the size of data

processed by this node is αn), the second one get (2)

so on. The recursion bottoms

out when the size of data becomes 1. Assume the recursion ends at level h, we have

(ℎ) = 1

h = log 1/ = lg(1/)/ lg = − lg / lg

Maximum depth m is similar with minimum depth

(1 − )() = 1

m = log1− 1/ = lg(1/)/ lg(1 − ) = − lg / lg(1 − )

There are two theme's to "The Gift of the Magi" one being Love and the other being Sacrifice. "The Gift of the Magi" gives it's lesson by showing that even in rough times there is still some "Love" in everyone's hearts.

By having the setting at Christmas time it shows the comparison to the men's gifts to Jesus.

Here is something to work off of because i am guessing you did not read it and are hoping for someone to do it for you.

Actually read it if you want a good grade.