just do IT

Question: Suppose that you want to output 0 with probability 1/2 and 1 with probability 1/2. At your disposal is a procedure BIASED-RANDOM, that outputs either 0 or 1. It outputs 1 with some probability p and 0 with probability 1 - p, where 0 = p) rc

Question:Write an O(n)-time nonrecursive procedure that, given an n-node binary tree, prints out the key of each node in the tree. Use a stack as an auxiliary data structure. Answer:This isn't a difficult question. But the skill of turning a recursive algo

A friend asked my idea about the exercise 5.1-2 of introduction to algorithms. Here is the original question:Question:Describe an implementation of the procedure RANDOM(a, b) that only makes calls to RANDOM(0, 1). What is the expected running time of your

Question:Give an O(n squared)-time algorithm to find the longest monotonically increasing subsequence of a sequence of n numbers.Answer:A brute-force approach is enumerate all subsequences of the n numbers and find out a monotonically increasing one with t

Question:Let X[1 .. n] and Y [1 .. n] be two arrays, each containing n numbers already in sorted order. Give an O(lg n)-time algorithm to find the median of all 2n elements in arrays X and Y.Answer:Without losing generality, suppose the median z is the sma