sort a linked list ???
hi,
the structure of my linked list looks like this :
typedef struct tag{
char name[100];
int emp_id;
float hrs_wkd;
struct tag *next;
}node;
Now, while inserting, i insert it based on the employee id. I need to print the list based on the employee name. For this, i have to sort the linked list based on the employee name first. Does anybody have a function for the sorting a linked list ?
thanks.
I don't wait for the future; it comes soon enough.
well how far have you got on your own? dont just ask for code until you have made an attempt at it yourself.
Free the weed!! Class B to class C is not good enough!!
And the FAQ is here :- http://faq.cprogramming.com/cgi-bin/smartfaq.cgi
If your instructor wants you to actually rearrange your tree and replay it via traversal, this answer won't help you.
In the "real world", where performance is a factor, you don't rearrange the data. That is cumbersome and slow. A professional would create a dynamic list of 'node*' to go with the tree. This is called an 'index' or 'hashing table'.
Each time you create a new node, you would increase the node* list by one. Each time you eliminate a node you would eliminate the corresponding node* entry.
This hashing table, in order to be useful, yet generic enough to be manipulated, quickly, is simply a list of pointers (node*). Each entry in the hash table contains a pointer to a node in the tree.
You can then use qsort() and the hash table to sort the data by any field in the data, and then you simply rearrange your hash table. You can then zip through the hash table, replay nodes in the order they appear in the hash table, and voila! sorted.
enjoy.
