sort.c: bubblesort fixed
* the bubblesort algorithm has an abort-condition
* the linearsort algorithm has not an abort-condition
committer: Markus Bröker <mbroeker@largo.homelinux.org>
#include <stdio.h>
#include <stdlib.h>
#include <list.h>
int main (int argc, char **argv)
{
Node *node, *begin;
int i;
node = begin = addnode (NULL, "BEGIN");
for (i = 0; i < 1000; i++)
node = addnode (node, "I need to strdup it!");
node = begin;
while (node) {
printf ("%s\n", node->data);
node = getnode (node);
}
return 0;
}