MESSAGE
| DATE | 2015-01-31 |
| FROM | Maneesh Kongara
|
| SUBJECT | Re: [LIU Comp Sci] Linked List Homework
|
From owner-learn-outgoing-at-mrbrklyn.com Sat Jan 31 20:08:07 2015
Return-Path:
X-Original-To: archive-at-mrbrklyn.com
Delivered-To: archive-at-mrbrklyn.com
Received: by mrbrklyn.com (Postfix)
id 43372161186; Sat, 31 Jan 2015 20:08:07 -0500 (EST)
Delivered-To: learn-outgoing-at-mrbrklyn.com
Received: by mrbrklyn.com (Postfix, from userid 28)
id 30F13161191; Sat, 31 Jan 2015 20:08:07 -0500 (EST)
Delivered-To: learn-at-mrbrklyn.com
Received: from mail-qc0-f172.google.com (mail-qc0-f172.google.com [209.85.216.172])
by mrbrklyn.com (Postfix) with ESMTP id 9E9F4161186
for ; Sat, 31 Jan 2015 20:08:06 -0500 (EST)
Received: by mail-qc0-f172.google.com with SMTP id x3so1914749qcv.3
for ; Sat, 31 Jan 2015 17:08:06 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed;
d=gmail.com; s=20120113;
h=mime-version:in-reply-to:references:date:message-id:subject:from:to
:content-type;
bh=03au+EvmnktgZD8Nl1yRV/cMclMph1TZv95nwTMVXX0=;
b=hSDbzT78zZ79xVFZ7uKOwWKrpnZd0S14d9VI8Y7bvRTWtuyv/KKum2j2qO3rDLlzpQ
1ZvpqJPONEDhVuNcv7fPW54Jn6JJH3CYPnjILIOzwacnJREYlUloO0Muef+BS0FJ8wMI
qZxJLAyAsJSEKNnnvrHbYwPcycqI+aBM6DrJE+/bCgAD6e9Ucvo+TeNYAsKc2WL1yDPE
TqOfAdbdWzBFcQdOa6oWACuR5NBcigRGzVAX7htrv3gKR63m2ua4z1a45eaVPzpK8ixs
wUJvLssx81LUuQbYadVDv0Jk0n4vcIZbu4Me1Nw4oXuA0POUEOviaf39NdJeD2zm5ofe
IhtQ==
MIME-Version: 1.0
X-Received: by 10.224.127.193 with SMTP id h1mr27006976qas.98.1422752885990;
Sat, 31 Jan 2015 17:08:05 -0800 (PST)
Received: by 10.229.19.4 with HTTP; Sat, 31 Jan 2015 17:08:05 -0800 (PST)
Received: by 10.229.19.4 with HTTP; Sat, 31 Jan 2015 17:08:05 -0800 (PST)
In-Reply-To: <54CD7C0E.5020808-at-panix.com>
References: <54CD7C0E.5020808-at-panix.com>
Date: Sat, 31 Jan 2015 20:08:05 -0500
Message-ID:
Subject: Re: [LIU Comp Sci] Linked List Homework
From: Maneesh Kongara
To: learn-at-mrbrklyn.com
Content-Type: multipart/alternative; boundary=001a1132ebe25f6d39050dfc78c2
Sender: owner-learn-at-mrbrklyn.com
Precedence: bulk
Reply-To: learn-at-mrbrklyn.com
--001a1132ebe25f6d39050dfc78c2
Content-Type: text/plain; charset=UTF-8
I wasn't able to build and run the header file for assignment 2. Did it
work for anyone out there?
Thanks,
Maneesh.
On Jan 31, 2015 8:06 PM, "Ruben Safir" wrote:
> For the Algorithms class:
>
> For what it is worth, there are a lot of errors inside of the code base
> for the linked list homework, which might make it very hard to actually
> do. The List Structure is NOT dependable as it is written and the Add
> Node after thingie is flatout written wrong.
>
> You end up with a head node with a value of zero that is a dummy node...
> or a stupid node actually because it is not only not needed, but it
> doesn't belong and it generates errors.
>
> My example for collaboration purposes is at
>
> http://www.nylxs.com/docs/grad_school/algorithms/Hwk2/
>
> specifically examine this
>
> 28 // InsertAfterNode: Create a new node containing val, and link it
> after np.
> 29 // This design is BROKEN. Nodes should never be handled directly but
> handled by the
> 30 // List structure which points to a specific node at all times.
> 31 // ALL List operations should happen through List
> 32
> 33 void InsertAfterNode(List& L, int val, node *np)
> 34 {
> 35 //this is broken - fix head
> 36 if(L.iter_pos == 0){
> 37 L.head = np;
> 38 L.head->data = val;
> 39 L.head->next = 0;
> 40 L.tail = L.head;
> 41 L.iter_pos = L.head; //initialize the list location
> 42 return;
> 43 }
> 44
> 45 node *np2 = new node;
> 46 np2->data = val;
> 47 np2->next = np->next;
> 48 np->next = np2;
> 49
> 50 if (np2->next == 0) L.tail = np2;
> 51 }
> 52
>
>
>
>
--001a1132ebe25f6d39050dfc78c2
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: quoted-printable
I wasn't able to build and run the header file for assig=
nment 2. Did it work for anyone out there?
Thanks,
Maneesh.
On Jan 31, 2015 8:06 PM, "Ruben Safir"= < mrbrklyn-at-panix.com> wrote= : :0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">For the Algorithms=
class:
For what it is worth, there are a lot of errors inside of the code base
for the linked list homework, which might make it very hard to actually
do.=C2=A0 The List Structure is NOT dependable as it is written and the Add=
Node after thingie is flatout written wrong.
You end up with a head node with a value of zero that is a dummy node...>
or a stupid node actually because it is not only not needed, but it
doesn't belong and it generates errors.
My example for collaboration purposes is at
=3D"_blank">http://www.nylxs.com/docs/grad_school/algorithms/Hwk2/
specifically examine this
=C2=A028 // InsertAfterNode: Create a new node containing val, and link it =
after np.
=C2=A029 //=C2=A0 This design is BROKEN.=C2=A0 Nodes should never be handle=
d directly but handled by the
=C2=A030 //=C2=A0 List structure which points to a specific node at all tim=
es.
=C2=A031 //=C2=A0 ALL List operations should happen through List
=C2=A032
=C2=A033 void InsertAfterNode(List& L, int val, node *np)
=C2=A034 {
=C2=A035=C2=A0 =C2=A0 //this is broken - fix head
=C2=A036=C2=A0 =C2=A0 =C2=A0if(L.iter_pos =3D=3D 0){
=C2=A037=C2=A0 =C2=A0 =C2=A0 =C2=A0 L.head =3D np;
=C2=A038=C2=A0 =C2=A0 =C2=A0 =C2=A0 L.head->data =3D val;
=C2=A039=C2=A0 =C2=A0 =C2=A0 =C2=A0 L.head->next =3D 0;
=C2=A040=C2=A0 =C2=A0 =C2=A0 =C2=A0 L.tail =3D L.head;
=C2=A041=C2=A0 =C2=A0 =C2=A0 =C2=A0 L.iter_pos =3D L.head; //initialize the=
list location
=C2=A042=C2=A0 =C2=A0 =C2=A0 =C2=A0 return;
=C2=A043=C2=A0 =C2=A0 =C2=A0}
=C2=A044
=C2=A045=C2=A0 =C2=A0 =C2=A0node *np2 =3D new node;
=C2=A046=C2=A0 =C2=A0 =C2=A0np2->data =3D val;
=C2=A047=C2=A0 =C2=A0 =C2=A0np2->next =3D np->next;
=C2=A048=C2=A0 =C2=A0 =C2=A0np->next =3D np2;
=C2=A049
=C2=A050=C2=A0 =C2=A0 =C2=A0if (np2->next =3D=3D 0) L.tail =3D np2;
=C2=A051 }
=C2=A052
--001a1132ebe25f6d39050dfc78c2--
|
|
