help ..please help me doing this .....problem.
Suppose L is a LIST and p, q, and r are positions. As a function of n, the length of list L, determine how many times the functions FIRST, END, and NEXT are excused by the following program.
p := FIRST(L);
while p <> END(L) do begin
q := p;
while q <> END(L) do begin
q := NEXT(q,L);
r := FIRST(L);
while r <> q do
r := NEXT(r,L);
end;
p := NEXT(p,L);
end;
I need to know what eaxctly meant by the brackets
<> .... q<>END(L) does it mean as long as q is not at the end of the list?? please help!!!!
> q<>END(L) does it mean as long as q is not at the end of the list?
That would be my guess.
But this looks like Pascal to me
It isn't C for sure...
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
What language are using? Doesn't look like C nor C++ to me....
1 rule of the Samurai Code: if you have nothing to say, don't say anything at all!
Pascal.
The <> means !=
Quzah.
<>
This is also != in VB, too.
Now, please tell me what != means ......
When it's written
while r <> q do
what exactly it means ..please
First off, you're on a C board. That code is Pascal. You're in the wrong place. Second, if you don't know what "!=" means, then you're still in the wrong place.
It means "not equal". In other words: r is not equal to q.
Quzah.
Thanks a lot.
Um...what language are you trying to do this code in? This can be done in C, but you are not showing any signs that you know C. Do you? Because we can help out, if you a have the basics of the language.
1978 Silver Anniversary Corvette
