I am getting this error "segmentation fault " when I am trying to run it , I don't know what is wrong with the code. This is the program -

#include <stdio.h>

typedef struct node
{
int val;
struct node* next;
} node;

int ll_equal(const node* a, const node* b)
{
while (a != NULL)
{
if (a->val != b->val)
return 0;
a = a->next;
b = b->next;
}
/* lists are equal if a and b are both null */
return a == b;
}

int main(int argc, char** argv)
{
int i;
node nodes[10];

for (i=0; i<10; i++)
{
nodes[i].val = 0;
nodes[i].next = NULL;
}

nodes[0].next = &nodes[1];
nodes[1].next = &nodes[2];
nodes[2].next = &nodes[3];

printf("equal test 1 result = %d\n", ll_equal(&nodes[0], &nodes[0]));
printf("equal test 2 result = %d\n", ll_equal(&nodes[0], &nodes[2]));

return 0;
}

Have you tried to examine the code using gdb (GNU debugger).
Look into it, debuggers are must for a programmer.

hope it helps

I think the problem is in the if conditional in the II_equal() funtion.

Note:: the last line shows the reason for segmentation fault.

1 members found this post helpful.

And that problem is, I think, because your code assumes that b is not null if a is not null.

1 members found this post helpful.

Moved: This thread is more suitable in <Programming> and has been moved accordingly to help your thread/question get the exposure it deserves.

Thank you guys it really helped , @PTrenholme yeah you were exactly right about the bug. Thanks once again.