Community Page
- blog.jploh.com/ Jump to website »
-
Subscribe -
Community
-
Top Commenters
-
Popular Threads
-
Recent Comments
- I second that Sebastian, unless you want it to remain close and opt for the unnecessary headache.
- Thanks for posting the code. It's really helpful although this was posted 2 years ago.
- Nag file ako ng case sa asawa coz nangiredo sya. At this time may lawyer sya Atty. winslow teodesio & Atty. cangreja. My lawyer is Atty. Panes & Atty. Penetrante. i got no evidence to show...
- Magandang hapon po Sir/Mam,bali po kapatid po ako ng magrereklamo at dumudulog sa inyo. Si Mrs. Irene Pamintuan po (ate ko) ngayon ay nagbabarko,nakiusap lang po sya sken na mag-email sa inyo. Kami...
- Interesting post. I have made a twitter post about this. Others no doubt will like it like I did.
Jump to original thread »
First off, iPodLinux won’t install on my iPod. It just keeps failing. I’m heart broken. Second, can’t Apple screw the fancy design for practical use? I always have a hard time unplugging the USB cable.
I’m still not in the mood to upload my songs. I’m putting up with Apache’s indexing until I get MythTV installed. […] ... Continue reading »
I’m still not in the mood to upload my songs. I’m putting up with Apache’s indexing until I get MythTV installed. […] ... Continue reading »
1 year ago
1 year ago
1 year ago
1 year ago
1 year ago
10 months ago
#include<stdio.h>
#include<stdlib.h>
#include<conio.h>
struct list
{
int data;
struct list *next;
};
typedef struct list node;
void init(node* record)
{
record->next=NULL;
}
void addnode(node* record,int d)
{
node* fresh;
fresh=(node *)malloc(sizeof(node));
fresh->data=d;
fresh->next=record->next;
record->next=fresh;
}
void print(node *record)
{
node* temp;
temp=(node *)malloc(sizeof(node));
for(temp=record->next;temp;temp=temp->next)
printf(" %d",temp->data);
}
void reverse(node* record)
{
node* temp;node* temp1;node* temp2;
temp=(node *)malloc(sizeof(node));
temp1=(node *)malloc(sizeof(node));
temp2=(node *)malloc(sizeof(node));
temp=record;temp1=temp->next;temp2=temp1->next;
temp->next->next=NULL;
while(temp2!=NULL)
{
temp=temp1;
temp1=temp2;
temp2=temp1->next;
temp1->next=temp;
}
record->next=temp1;
}
int main(void)
{
node* start;
node* start1;
start=(node *) malloc(sizeof(node));
init(start);
int i=0;
for(i=10;i>=0;i--)
addnode(start,i);
getch();
print(start);
getch();
reverse(start);
getch();
print(start);
getch();
return 0;
}