Thread: Insertion sort

Code:

void insertionSort()
	{
		node* temp=head;	
		
		while(temp->next != NULL)
		{
			node* second =temp->next;
			if (second->exponent==temp->exponent)
			{
				temp=temp->next;
			}
			else
			{
				second->previous->next=second->next;
				second->next->previous=second->previous;
				
				if (head->exponent > second->exponent)
				{
					second->next=head;
					second->previous=NULL;
					head->previous=second;
					head= second;
				}
				node* current = head->next;
			
				while(current->exponent < second->exponent)
				{
					current=current->next;
				}
				second->next=current;
				second->previous=current->previous;
				current->previous->next=second;
				current->previous=second;
			}
		}
	}

I have made insertion sort funtion for a doubly linked list , but its not working , i cant figure out the errors.If anybody can guide a bit. =|

I dun know how to work with the templates i would be thankful, if u point out where my code needs to changed i would be thnakful.

I have made a doubly linked list of polynomials and now i am using operator overloading to add two polynomials. The add function see its the exponents of the two polynomials are same and then add them. It returns the only node after addition whose addition is being done, but i want to get the whole list of polynomials , whether they are added or not.
e.g
1x^1 2x^2 when added with 1x^1 3x^6
gives
2x^1 2x^2 3x^6
So kindly tell how to insert the terms (those whose exponents dont match) to the result list.

Code:

	list operator + (const list& k)
	{
		node* first;
		first = head;
		node* second;
		second = k.head;
		
		node* result=head;
		list r;
		
		while (first != NULL)
		{
			while (second != NULL)
			{
				if (first->exponent == second->exponent )
				{
					
					result->coefficient	=first->coefficient + second->coefficient;
					result->exponent=first->exponent;
					
				}
				second=second->next;
			}
			first=first->next;
		}
		r.insert(result->coefficient,result->exponent);
		return r;
	}

Ok thnks . And what about the second problem

Code:

if (first->exponent == second->exponent )
				{
					result->coefficient	=first->coefficient - second->coefficient;
					result->exponent=first->exponent;
					r.insert(result->coefficient,result->exponent);
                  // AFTER INSERTION I WANT TO DELETE THE NODE OF FIRST AND SECOND whose exponent are same, but m having problem with this. 
				
				}