evasean

题目要求：An array is bitonic if it is comprised of an increasing sequence of integers followed immediately by a decreasing sequence of integers. Write a program that, given a bitonic array of n distin

题目要求：Design an algorithm for the 3-SUM problem that takes time proportional to n2 in the worst case. You may assume that you can sort the n integers in time proportional to n2 or better.分析：

Suppose that you have an n-story building (with floors 1 through n) and plenty of eggs. An egg breaks if it is dropped from floor T or higher and does not break otherwise.

这次作业与第一周作业相比，稍微简单一些。有三个编程练习：双端队列（Deque）设计、随机队列（Randomized Queue）设计，还有一个排列组合类Permutation。一、双端队列Deque设计要求：A double-ended queue or deque (pronounced "deck") is a generalization of a stack and a q

题目来源http://coursera.cs.princeton.edu/algs4/assignments/percolation.html作业分为两部分：建立模型和仿真实验。最关键的部分就是建立模型对象。模型对象要求如下：The model. We model a percolation system using an n-by-n grid of sites. Each si

题目原文：Add a method find() to the union-find data type so that find(i) returns the largest element in the connected component containing i. The operations, union(), connected(), and find() sho

题目原文：Given a set of n integers S = {0,1,…,N-1}and a sequence of requests of the following form:Remove x from SFind the successor of x: the smallest y in S such thaty>=xdesign a

题目原文描述：Given a social network containing n members and a log file containing m timestamps at which times pairs of members formed friendships, design an algorithm to determine the earliest time