| | |
sum of the linked list
![]() |
•
•
Join Date: Sep 2006
Posts: 26
Reputation:
Solved Threads: 0
i want to add all the inserted linked list by using this code
but what happens here if i input 15 then 35 =50 but when i input again 30 the sum is 50whats wrong with my code?
but what happens here if i input 15 then 35 =50 but when i input again 30 the sum is 50whats wrong with my code?
C Syntax (Toggle Plain Text)
int sum(nd **head){ nd *p,*sum1; p=*head; sum1=0; while(p!=NULL) { sum1->x=p->x; p=p->next; return sum1->x=sum1->x+p->x; } }
why is sum a linked list and not a simple integer?
int sum(nd **head){
nd *pl
int sum1 = 0;
p=*head;
while(p!=NULL)
{
sum1 += p->x;
p=p->next;
}
return sum1;
}•
•
Join Date: Sep 2006
Posts: 26
Reputation:
Solved Threads: 0
•
•
•
•
why is sum a linked list and not a simple integer?
int sum(nd **head){ nd *pl int sum1 = 0; p=*head; while(p!=NULL) { sum1 += p->x; p=p->next; } return sum1; }

how about this one where i want to locate if the linked list is in the lis?
C Syntax (Toggle Plain Text)
int locate(nd **head,int num){ nd *p; p=*head; while(p!=NULL) { p=p->next; if(num==p->x) return 1; else return 0; } }
•
•
Join Date: Sep 2006
Posts: 26
Reputation:
Solved Threads: 0
•
•
•
•
why is sum a linked list and not a simple integer?
int sum(nd **head){ nd *pl int sum1 = 0; p=*head; while(p!=NULL) { sum1 += p->x; p=p->next; } return sum1; }
•
•
•
•
actualy i dont know how to di this ...i tired you code it works
how about this one where i want to locate if the linked list is in the lis?
C Syntax (Toggle Plain Text)
int locate(nd **head,int num){ nd *p; p=*head; while(p!=NULL) { p=p->next; if(num==p->x) return 1; else return 0; } }
nd *p;
p=*head;
while(p!=NULL)
{
p=p->next;
}
if(num==p->x)
return 1;
else
return 0;
}
the code above always return to xero
•
•
•
•
int locate(nd **head,int num){
nd *p;
p=*head;
while(p!=NULL)
{
p=p->next;
}
if(num==p->x)
return 1;
else
return 0;
}
the code above always return to xero
C Syntax (Toggle Plain Text)
int locate(nd **head,int num){ nd *p; p=*head; while(p!=NULL) { p=p->next; if(num==p->x) return 1; } return 0; }
•
•
Join Date: Sep 2006
Posts: 26
Reputation:
Solved Threads: 0
•
•
•
•
Look and think about the logic in the code you posted, pay attention to the while loop. All it does is iterate through the linked list without stopping. The if statement needs to be inside the loop -- I did not tell you to move it outside the loop. The else part shoud not be there at all.
C Syntax (Toggle Plain Text)
int locate(nd **head,int num){ nd *p; p=*head; while(p!=NULL) { p=p->next; if(num==p->x) return 1; } return 0; }
thankls it work
:cheesy: ![]() |
Similar Threads
Other Threads in the C Forum
- Previous Thread: read text file
- Next Thread: Read from a csv file
| Thread Tools | Search this Thread |
#include * adobe ansi api array asterisks binarysearch centimeter changingto char character cm copyimagefile cprogramme creafecopyofanytypeoffileinc createcopyoffile csyntax database directory dynamic feet fgets file fork frequency function getlasterror getlogicaldrivestrin givemetehcodez global grade graphics gtkgcurlcompiling gtkwinlinux hacking highest histogram include incrementoperators infiniteloop input interest kernel keyboard kilometer linked linkedlist linux linuxsegmentationfault list locate logical_drives looping loopinsideloop. lowest match matrix meter microsoft mqqueue mysql number odf opendocumentformat owf pattern pdf performance pointer posix probleminc process program programming radix recursion recv repetition research reversing scanf segmentationfault sequential shape single socket socketprograming standard string systemcall threads turboc unix user voidmain() wab whythiscodecausesegmentationfault windows.h windowsapi






