Breaking News: Grepper is joining You.com. Read the official announcement!

insertion sort for doubly linked list

Confused Capybara answered on July 21, 2023 Popularity 7/10 Helpfulness 2/10

answer insertion sort for doubly linked list

related Insertion sort using doubly linked list

insertion sort for doubly linked list

Comment

void sort(node **q)
{
	int n;
	node *cur;
	cur=*q;
	if (cur->next==NULL)
		return;
	
	node *ptr,*tmp;
	cur=cur->next;

	while(cur!=NULL)
	{
		n=0;
		ptr=cur;
		tmp=cur->prev;
		cur=cur->next;

		while (tmp!=NULL && tmp->data>ptr->data)
		{
			n++;
			tmp=tmp->prev;
		}

		if (n)
		{
			
			ptr->prev->next=ptr->next;
			if (ptr->next!=NULL)
			ptr->next->prev=ptr->prev;
	
			if (tmp==NULL)
			{
				tmp=*q;
				ptr->prev=NULL;
				ptr->next=tmp;
				ptr->next->prev=ptr;
				*q=ptr;
			}
			else
			{
				tmp=tmp->next;
				tmp->prev->next=ptr;
				ptr->prev=tmp->prev;
				tmp->prev=ptr;
				ptr->next=tmp;
			}
		}


	}
}

Popularity 7/10 Helpfulness 2/10 Language c

Source: www.daniweb.com

Tags: c insertion-sort linked-list

Link to this answer
Share Copy Link

Contributed on Jul 21 2023

Confused Capybara

0 Answers Avg Quality 2/10

Closely Related Answers

Insertion sort using doubly linked list

Comment

void insertion_sort_list(listint_t **list)
{
        listint_t *sorted, *curr, *next, *aux, *temp;

        sorted = NULL;
        curr = *list;

        while (curr != NULL)
        {
                next = curr->next;

                if (sorted == NULL || sorted->n > curr->n)
                {
                        curr->next = sorted;
                        sorted = curr;
                } else
                {
                        aux = sorted;

                        while (aux->next != NULL && aux->next->n <= curr->n)
                                aux = aux->next;

                        if (aux->next == NULL)
                        {
                                aux->next = curr;
                                curr->prev = aux;
                                curr->next = NULL;
                        } else
                        {
                                temp = aux->next;
                                aux->next = curr;
                                curr->prev = aux;
                                curr->next = temp;
                                temp->prev = curr;
                        }
                }

                curr = next;
        }

        *list = sorted;
}

Popularity 1/10 Helpfulness 1/10 Language whatever

Source: stackoverflow.com

Tags: using whatever insertion-sort linked-list

Link to this answer
Share Copy Link

Contributed on Mar 08 2024

Marvin Agyei

0 Answers Avg Quality 2/10

insertion sort for doubly linked list

Contents

More Related Answers

insertion sort for doubly linked list

Closely Related Answers

Insertion sort using doubly linked list

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.