:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">On 01/22/2015 07:3=
4 PM, Maneesh Kongara wrote:

> Sure thing. I'll post mine on the group soon.

> Thanks,





I was thinking last night, as I was sleeping, that I'm not even happyr>
with this result.=C2=A0 the problem is what happens if you drop a data poin=
t

far off the existing data, so that, say, you have an array of 100 and 10>
items in the array in positions from 0-10.=C2=A0 Then I InsertByPosition,r>
into spot 61.=C2=A0 You have junk between L.a[L.last] and L.a[60] (the 61st=


position).



You need to clean all that out so you have to have a third condition

within that function for insertions past last and before the end of the

array.



Also, this whole thing should be rewritten with pointers.



intpt * =3D L.a; and then do the math like that.=C2=A0 It is much cleaner a=
nd

professional code.



> Maneesh.

> On Jan 22, 2015 7:30 PM, "Ruben Safir" <:mrbrklyn-at-panix.com">mrbrklyn-at-panix.com> wrote:

>

>> I've loaded my version of assignment 1 onto the NYLXS webserve=
r at

>>

>>

>> _1_lists/list.cpp.html" target=3D"_blank">http://www.nylxs.com/docs/grad_sc=
hool/algorithms/hw/ass_1_lists/list.cpp.html

>>

>> _1_lists" target=3D"_blank">http://www.nylxs.com/docs/grad_school/algorithm=
s/hw/ass_1_lists

>>

>> Look it over and please edit and comment

>>

>> A few thoughts:

>>

>>

>> First, I changed to order of the function listings because we are =
not

>> using function declarations so the order that they are defined is<=
br>
>> essential because they call each other.=C2=A0 Ideally, one would m=
ake a .h file.

>>

>> Secondly, the given skeleton was essentially broken and I had to r=
ewrite

>> all the functions.=C2=A0 As it was, it not only didn't track t=
he last entries

>> correctly near L.n =3D=3D L.last, but also used an incorrect algor=
ithm to

>> find is a list was full

>>

>> Thirdly, I reduced the size of the array from 100 to 5 so I could =
debug

>> it and show who it works.

>>

>> Fourthly, it takes some interpretation of the intent of the assign=
ment

>> specifications to correctly right the code.=C2=A0 This is all to c=
ommon of a

>> problem.=C2=A0 Give me the Spec! (I guess UML might be good for so=
mething).

>> As such, when the array is full and I'm adding from the last, =
then I

>> chose to push results forward and bump the first value.=C2=A0 Like=
wise, for

>> InsertBegin, I push everything forward.=C2=A0 He wrote this, actua=
lly, but I

>> filled in the case of what to do when the array is filled.=C2=A0 I=
then give

>> a warning and bump the last value out of the array.

>>

>> Fifth:=C2=A0 See my makefile and do yourself a favor and copy it a=
nd use it.

>> BTW - GVIM is your friend.

>>

>> Sixth:=C2=A0 I let debugging code in my code.=C2=A0 You can best r=
un it like this

>>

>> list 2> /dev/nulll

>>

>> Even with that, it is quite chatty.

>>

>> Ruben

>>