cheetach的专栏

In HIRE-ASSISTANT, assuming that the candidates are presented in a random order, what is the probability that you hire exactly twice?AnlysisObservation 1: You have to hire the first person int

Problem 5.3-6Explain how to implement the algorithm PERMUTE-BY-SORTING to handle thecase in which two or more priorities are identical. That is, your algorithm shouldproduce a uniform random per

6.5-8The operation HEAP-DELETE.A; i / deletes the item in node i from heap A. Givean implementation of HEAP-DELETE that runs in O.lg n/ time for an n-elementmax-heap.Solution1. Find the

6-3 Young tableausAn m × n Young tableau is an m × n matrix such that the entries of each row arein sorted order from left to right and the entries of each column are in sorted orderfrom top to

6.5-9Give an O.n lg k/-time algorithm to merge k sorted lists into one sorted list,where n is the total number of elements in all the input lists. (Hint: Use a minheapfor k-way merging.)So

9.2-3Write an iterative version of RANDOMIZED-SELECTAnalyse:For this the original recursive algorithm, the recursion doesn't need to remember the intermediate information, ie. there is no co

9.1-1Show that the second smallest of n elements can be found with n + lg n - 2comparisons in the worst case. (Hint: Also find the smallest element.)I thinked about it for some time and

6.5.6Each exchange operation on line 5 of HEAP-INCREASE-KEY typically requiresthree assignments. Show how to use the idea of the inner loop of INSERTIONSORTto reduce the three assignments down t