for (int i = 0;i<temp-1;i++)
		{
			current = dll->head;
			for (int j=0; j<temp-1; j++)
			{
				struct node_t *before, *after;
				if (current->data > current->next->data)
				{
					if (dll->head == current)
						dll->head = current->next;
					if (dll->tail == current->next)
						dll->tail = current;
					before = current->prev;
					after = current->next;
					if (before != NULL)
					{
						before->next = after;
					}
					current->next = after->next;
					current->prev = after;
					after->next = current;
					after->prev = before;
				}
			}
		}