just do IT

Question: Give an O(n squared)-time algorithm to find the longest monotonically increasing subsequence of a sequence of n numbers. Answer: A...

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 st...

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 ...

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, ...

A friend asked my idea about the exercise 5.1-2 of introduction to algorithms . Here is the original question: Question: Describe an impleme...