Return-Path: william@bourbon.usc.edu Delivery-Date: Thu Oct 23 21:23:25 2008 X-Spam-Checker-Version: SpamAssassin 3.2.3 (2007-08-08) on merlot.usc.edu X-Spam-Level: X-Spam-Status: No, score=-2.3 required=5.0 tests=AWL,BAYES_00 autolearn=ham version=3.2.3 Received: from bourbon.usc.edu (bourbon.usc.edu [128.125.9.75]) by merlot.usc.edu (8.14.1/8.14.1) with ESMTP id m9O4NOR5030004 for ; Thu, 23 Oct 2008 21:23:24 -0700 Received: from bourbon.usc.edu (localhost.localdomain [127.0.0.1]) by bourbon.usc.edu (8.14.2/8.14.1) with ESMTP id m9O4XRpJ008331 for ; Thu, 23 Oct 2008 21:33:27 -0700 Message-Id: <200810240433.m9O4XRpJ008331@bourbon.usc.edu> To: cs551@merlot.usc.edu Subject: Re: CS551: Final Project: Date: Thu, 23 Oct 2008 21:33:27 -0700 From: Bill Cheng Someone wrote: > The spec says: > > "The above implies that a node should keep message UOIDs in memory and have > an efficient way to see if a message UOID has been seen before. Efficient > here is defined as O(log(n)), where n is the number of message UOIDs in your > data structure." > > Is it mandatory to implement it this way ? or can we use a linear search for > checking if a UOID has been seen before? If you keep on read the spec, within the same paragraph, it says that it is not a requirement. -- Bill Cheng // bill.cheng@usc.edu