name="google_ads_frame" marginwidth="0" marginheight="0" src="http://pagead2.googlesyndication.com/pagead/ads?client=ca-pub-5572165936844014&dt=1194442938015&lmt=1194190197&format=336x280_as&output=html&correlator=1194442937843&url=file%3A%2F%2F%2FC%3A%2FDocuments%2520and%2520Settings%2Flhh1%2F%E6%A1%8C%E9%9D%A2%2FCLanguage.htm&color_bg=FFFFFF&color_text=000000&color_link=000000&color_url=FFFFFF&color_border=FFFFFF&ad_type=text&ga_vid=583001034.1194442938&ga_sid=1194442938&ga_hid=1942779085&flash=9&u_h=768&u_w=1024&u_ah=740&u_aw=1024&u_cd=32&u_tz=480&u_java=true" frameborder="0" width="336" scrolling="no" height="280" allowtransparency="allowtransparency"> #include <stdio.h>
#include <alloc.h>
void main(void)
{
int i;
struct ListEntry
{
int number;
struct ListEntry *next;
struct ListEntry *previous;
} start, *node, *new;
start.next = NULL; // Empty list
start.previous = NULL;
node = &start; // Point to the start of the list
for (i = 1; i < 10; i += 2)
{
node->next = (struct ListEntry *) malloc(sizeof(struct ListEntry));
node->next->previous = node;
node = node->next;
node->number = i;
node->next = NULL;
}
for (i = 2; i <= 10; i += 2)
{
int found = 0;
new = (struct ListEntry *) malloc(sizeof(struct ListEntry));
new->number = i;
node = start.next;
do
{
if (node->number > new->number)
{
new->next = node;
new->previous = node->previous;
node->previous->next = new;
node->previous = new;
found = 1;
}
else
node = node->next;
} while ((node->next) && (! found));
if (! found)
if (node->number > new->number)
{
new->next = node;
new->previous = node->previous;
node->previous->next = new;
node->previous = new;
}
else
{
new->next = NULL;
new->previous = node;
node->next = new;
}
}
// Display the list
node = start.next;
do
{
printf("%d ", node->number);
node = node->next;
} while (node);
}