Insertion Sort

void List::insert(int value){		Node* curr = new Node(value);		Node* temp, *temp2;		if(head == NULL){			head = curr;			tail = curr;			return;		}		temp = head;		while(temp->getNext() != NULL && value > temp->getData())			temp = temp->getNext();							if(value > temp->getData()){				if(temp->getNext() == NULL){				temp->setNext(curr);				curr->setPrevious(temp);				tail = curr;			}			return;		}				temp2 = temp->getPrevious();				if(temp2 != NULL){			curr->setPrevious(temp2);			temp2->setNext(curr);		}		temp->setPrevious(curr);		curr->setNext(temp);				if(temp == head)			head = curr;}