void sort(List& myList)
    {
        for (int i = 1;  i <= myList.size; i++)
        {
            Node* currentNode;
            currentNode = get(myList,i);
            while( (currentNode != NULL) && (currentNode->prev->data > currentNode->data ) )
            {
                Node* tempNode;
                Node* ptr;
                tempNode = currentNode->prev;
                ptr = tempNode->prev;

                tempNode->prev = currentNode;
                currentNode->prev = ptr;

                tempNode->next = currentNode->next;
                currentNode->next = tempNode;
                ptr = currentNode;

                currentNode = currentNode->prev;
            }
        }
    }