Node* temp = NULL;
    Node* current = head;
    Node* next;
    Node* point = head;
    bool sorted = false;

    while(sorted){
        sorted = false;
        while (current != NULL){
            next = current->next;
            if (current > next){
                temp = current;
                current = next;
                next = temp;
                sorted = true;
            }
            current = current ->next;
        }
    }
    return current;