Here is my compiling code thus far
Code:
void mergesort(node *start,node *stop)
{
node * mid;
if (start->nxt != NULL)
{
mid = find_mid(start,stop);
mergesort(start,mid);
mergesort(mid->nxt,stop);
merge(start,mid,stop);
}
}
void merge(node *start,node *mid,node *stop)
{
bucket_struct newList;
newList.head=NULL;
newList.tail=NULL;
node *l1 = start;
node* l2 = mid->nxt;
mid->nxt = NULL;
while(l1 != NULL && l2 != NULL)
{
if(l1->node_struct.d_name <= l2->node_struct.d_name)
{
if(newList.head= NULL)
{
newList.head = l1;
}
newList.tail->nxt = l1;
l1 = l1->nxt;
}
else
{
if(newList.head = NULL)
{
newList.head = l2;
}
newList.tail->nxt = l2;
l2 = l2->nxt;
}
}
start_ptr = newList.head;
}
node *find_mid(node *start, node *stop)
{
}