<?xml version="1.0" ?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
<channel>
  <atom:link rel="search"
    href="http://www.nnseek.com/nnseek_com_os_descr.xml"
    type="application/opensearchdescription+xml"
    title="Search in newsgroups" />
  <title>Search result for Rycroft</title>
  <link>http://www.nnseek.com/Rycroft_s.html</link>
  <description>Search results for Rycroft</description>
  <lastBuildDate>Fri, 21 Mar 2008 13:49:08 PDT</lastBuildDate>
  <image>
    <title>http://www.nnseek.com/</title>
    <link>http://www.nnseek.com/</link>
    <url>http://www.nnseek.com/img/64.png</url>
    <width>64</width>
    <height>64</height>
    <description>NNSeek</description>
  </image>

  <item>
    <title><![CDATA[Re: Comparator]]></title>
    <guid>http://www.nnseek.com/e/uw.cs.cs341/comparator_431587843m.html</guid>
    <link>http://www.nnseek.com/e/uw.cs.cs341/comparator_431587843m.html</link>
    <description><![CDATA[Oops, you are correct.  I didn't look closely enough at the API.  Ah well.    On Thu, 20 Mar 2008 13:09:28 -0400, Evan Stratford wrote:    Scott <b>Rycroft</b> wrote:  'fudge it' is such an ugly word for it.  I prefer 'necessary  workaround'. :)  Angus Sinclair wrote:  you can if you handle those "updates" carefully I think. you kind of  have to fudge it.  Yes, but the ...<br><br>
    <table border="0" cellspacing="0" cellpadding="0">
      <tr>
        <td width="30">&nbsp;</td>
        <td>Posted In: <a href="http://www.nnseek.com/e/uw.cs.cs341/">uw.cs.cs341</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/uw.cs.cs341/comparator_427080963t.html">no comments</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/uw.cs.cs341/comparator_431587843m.html">Reply</a></td>
      </tr></table>]]></description>
    <pubDate>Fri, 21 Mar 2008 13:49:08 PDT</pubDate>
  </item>
  <item>
    <title><![CDATA[Re: Comparator]]></title>
    <guid>http://www.nnseek.com/e/uw.cs.cs341/comparator_429797891m.html</guid>
    <link>http://www.nnseek.com/e/uw.cs.cs341/comparator_429797891m.html</link>
    <description><![CDATA[Scott <b>Rycroft</b> wrote:  'fudge it' is such an ugly word for it.  I prefer 'necessary   workaround'. :)  Angus Sinclair wrote:  you can if you handle those "updates" carefully I think. you kind of   have to fudge it.    Yes, but the obvious workaround using Java's PriorityQueue destroys your   runtime.    -- evan<br><br>
    <table border="0" cellspacing="0" cellpadding="0">
      <tr>
        <td width="30">&nbsp;</td>
        <td>Posted In: <a href="http://www.nnseek.com/e/uw.cs.cs341/">uw.cs.cs341</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/uw.cs.cs341/comparator_427080963t.html">no comments</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/uw.cs.cs341/comparator_429797891m.html">Reply</a></td>
      </tr></table>]]></description>
    <pubDate>Thu, 20 Mar 2008 10:09:28 PDT</pubDate>
  </item>
  <item>
    <title><![CDATA[Re: A3 coding marks]]></title>
    <guid>http://www.nnseek.com/e/uw.cs.cs341/a3_coding_marks_426705923m.html</guid>
    <link>http://www.nnseek.com/e/uw.cs.cs341/a3_coding_marks_426705923m.html</link>
    <description><![CDATA[  It is included in the mark on the hardcopy of your assignment. I will also  send the marks by email to all students, including the breakdown of marks, by tonight.    On Tue, 18 Mar 2008, Scott <b>Rycroft</b> wrote:    Where do we find our marks for the coding section?  <br><br>
    <table border="0" cellspacing="0" cellpadding="0">
      <tr>
        <td width="30">&nbsp;</td>
        <td>Posted In: <a href="http://www.nnseek.com/e/uw.cs.cs341/">uw.cs.cs341</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/uw.cs.cs341/a3_coding_marks_426544387t.html">no comments</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/uw.cs.cs341/a3_coding_marks_426705923m.html">Reply</a></td>
      </tr></table>]]></description>
    <pubDate>Tue, 18 Mar 2008 11:09:35 PDT</pubDate>
  </item>
  <item>
    <title><![CDATA[Re: A4 Sirius Problem]]></title>
    <guid>http://www.nnseek.com/e/uw.cs.cs341/a4_sirius_problem_426566659m.html</guid>
    <link>http://www.nnseek.com/e/uw.cs.cs341/a4_sirius_problem_426566659m.html</link>
    <description><![CDATA[...:  We are looking for "heap" implementation of dijkstra.  On Mon, 17 Mar 2008, Scott <b>Rycroft</b> wrote:  When the assignment says "should not take more time than running  Dijkstra’s algorithm", what version ... better or worse)  version?  On Mon, 17 Mar 2008 00:30:58 +0000, Scott <b>Rycroft</b> wrote:  Also to clarify, is going from (x,y) to (x+1,y+1) considered one unit?...<br><br>
    <table border="0" cellspacing="0" cellpadding="0">
      <tr>
        <td width="30">&nbsp;</td>
        <td>Posted In: <a href="http://www.nnseek.com/e/uw.cs.cs341/">uw.cs.cs341</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/uw.cs.cs341/a4_sirius_problem_419792387t.html">no comments</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/uw.cs.cs341/a4_sirius_problem_426566659m.html">Reply</a></td>
      </tr></table>]]></description>
    <pubDate>Tue, 18 Mar 2008 09:25:30 PDT</pubDate>
  </item>
  <item>
    <title><![CDATA[Re: A4 Sirius Problem]]></title>
    <guid>http://www.nnseek.com/e/uw.cs.cs341/a4_sirius_problem_424103171m.html</guid>
    <link>http://www.nnseek.com/e/uw.cs.cs341/a4_sirius_problem_424103171m.html</link>
    <description><![CDATA[... than running   Dijkstra’s algorithm", what version of Dijkstra's should we be comparing   to?  The one we will be using or some other (possibly better or worse)   version?    On Mon, 17 Mar 2008 00:30:58 +0000, Scott <b>Rycroft</b> wrote:    Also to clarify, is going from (x,y) to (x+1,y+1) considered one unit?  On Thu, 13 Mar 2008 21:22:18 -0400, Mina Razaghpour wrote:  It means going ...<br><br>
    <table border="0" cellspacing="0" cellpadding="0">
      <tr>
        <td width="30">&nbsp;</td>
        <td>Posted In: <a href="http://www.nnseek.com/e/uw.cs.cs341/">uw.cs.cs341</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/uw.cs.cs341/a4_sirius_problem_419792387t.html">no comments</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/uw.cs.cs341/a4_sirius_problem_424103171m.html">Reply</a></td>
      </tr></table>]]></description>
    <pubDate>Sun, 16 Mar 2008 18:53:51 PDT</pubDate>
  </item>
  <item>
    <title><![CDATA[Re: A4 Sirius Problem]]></title>
    <guid>http://www.nnseek.com/e/uw.cs.cs341/a4_sirius_problem_424087555m.html</guid>
    <link>http://www.nnseek.com/e/uw.cs.cs341/a4_sirius_problem_424087555m.html</link>
    <description><![CDATA[    No, this is sqrt(2) units (euclidean distance between the 2 points).      On Mon, 17 Mar 2008, Scott <b>Rycroft</b> wrote:    Also to clarify, is going from (x,y) to (x+1,y+1) considered one unit?  On Thu, 13 Mar 2008 21:22:18 -0400, Mina Razaghpour wrote:  It means going directly from (x,y) to (x+1,y+1), or generally, walking  along the direct line between any two points (as long as ...<br><br>
    <table border="0" cellspacing="0" cellpadding="0">
      <tr>
        <td width="30">&nbsp;</td>
        <td>Posted In: <a href="http://www.nnseek.com/e/uw.cs.cs341/">uw.cs.cs341</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/uw.cs.cs341/a4_sirius_problem_419792387t.html">no comments</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/uw.cs.cs341/a4_sirius_problem_424087555m.html">Reply</a></td>
      </tr></table>]]></description>
    <pubDate>Sun, 16 Mar 2008 18:16:38 PDT</pubDate>
  </item>
  <item>
    <title><![CDATA[Re: -infinity C]]></title>
    <guid>http://www.nnseek.com/e/uw.cs.cs341/infinity_c_390022403m.html</guid>
    <link>http://www.nnseek.com/e/uw.cs.cs341/infinity_c_390022403m.html</link>
    <description><![CDATA[...int** array = new int*[n];  for (int i=0; i<n; i++) array[i]=new int [n];    But yeah, STL is about as easy as Java.    On Sun, 24 Feb 2008 14:28:07 -0500, Gordon V. Cormack wrote:    Scott <b>Rycroft</b> wrote:  void func(int** array, int n)  That's an array of pointers, not a 2-d array.  or use Java :)  Let's not get carried away.  STL will do it, or you can create your own  ...<br><br>
    <table border="0" cellspacing="0" cellpadding="0">
      <tr>
        <td width="30">&nbsp;</td>
        <td>Posted In: <a href="http://www.nnseek.com/e/uw.cs.cs341/">uw.cs.cs341</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/uw.cs.cs341/infinity_c_389942019t.html">no comments</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/uw.cs.cs341/infinity_c_390022403m.html">Reply</a></td>
      </tr></table>]]></description>
    <pubDate>Sun, 24 Feb 2008 11:45:03 PST</pubDate>
  </item>
  <item>
    <title><![CDATA[Re: -infinity C]]></title>
    <guid>http://www.nnseek.com/e/uw.cs.cs341/infinity_c_390016515m.html</guid>
    <link>http://www.nnseek.com/e/uw.cs.cs341/infinity_c_390016515m.html</link>
    <description><![CDATA[Scott <b>Rycroft</b> wrote:  void func(int** array, int n)    That's an array of pointers, not a 2-d array.    or use Java :)    Let's not get carried away.  STL will do it, or  you can create your own mapping function.    #define myarray(a,b,c) = x[((a)*d1+(b))*d2+(c)]<br><br>
    <table border="0" cellspacing="0" cellpadding="0">
      <tr>
        <td width="30">&nbsp;</td>
        <td>Posted In: <a href="http://www.nnseek.com/e/uw.cs.cs341/">uw.cs.cs341</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/uw.cs.cs341/infinity_c_389942019t.html">no comments</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/uw.cs.cs341/infinity_c_390016515m.html">Reply</a></td>
      </tr></table>]]></description>
    <pubDate>Sun, 24 Feb 2008 11:28:07 PST</pubDate>
  </item>
  <item>
    <title><![CDATA[Re: test data for A3]]></title>
    <guid>http://www.nnseek.com/e/uw.cs.cs341/test_data_for_a3_387790851m.html</guid>
    <link>http://www.nnseek.com/e/uw.cs.cs341/test_data_for_a3_387790851m.html</link>
    <description><![CDATA[  The input file will be formatted correctly. You don't need to check.      On Fri, 22 Feb 2008, Scott <b>Rycroft</b> wrote:    Can we also assume that the input file will be formatted correctly  (valid), or do we have to check?  On Thu, 21 Feb 2008 23:31:37 -0500, Angus Sinclair wrote:  Considering that this is due so soon after reading week and the fact  that there are multiple cs ...<br><br>
    <table border="0" cellspacing="0" cellpadding="0">
      <tr>
        <td width="30">&nbsp;</td>
        <td>Posted In: <a href="http://www.nnseek.com/e/uw.cs.cs341/">uw.cs.cs341</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/uw.cs.cs341/test_data_for_a3_382307075t.html">no comments</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/uw.cs.cs341/test_data_for_a3_387790851m.html">Reply</a></td>
      </tr></table>]]></description>
    <pubDate>Fri, 22 Feb 2008 20:27:21 PST</pubDate>
  </item>
  <item>
    <title><![CDATA[Re: test data for A3]]></title>
    <guid>http://www.nnseek.com/e/uw.cs.cs341/test_data_for_a3_387170051m.html</guid>
    <link>http://www.nnseek.com/e/uw.cs.cs341/test_data_for_a3_387170051m.html</link>
    <description><![CDATA[And another thing, what do we do for deciding between multiple optimal   solutions?    On Fri, 22 Feb 2008 16:08:08 +0000, Scott <b>Rycroft</b> wrote:    Can we also assume that the input file will be formatted correctly  (valid), or do we have to check?  On Thu, 21 Feb 2008 23:31:37 -0500, Angus Sinclair wrote:  Considering that this is due so soon after reading week and the fact  ...<br><br>
    <table border="0" cellspacing="0" cellpadding="0">
      <tr>
        <td width="30">&nbsp;</td>
        <td>Posted In: <a href="http://www.nnseek.com/e/uw.cs.cs341/">uw.cs.cs341</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/uw.cs.cs341/test_data_for_a3_382307075t.html">no comments</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/uw.cs.cs341/test_data_for_a3_387170051m.html">Reply</a></td>
      </tr></table>]]></description>
    <pubDate>Fri, 22 Feb 2008 10:09:52 PST</pubDate>
  </item>
</channel>
</rss>