Сортировка двусвязного списка

#include "MyList.h"
 
struct Node
{
    Product* product;
    size_t count;
    Node* next;
    Node* prev;
    Node(Product* product);
    Node();
};
 
Node::Node(Product* product) : product(product), count(1), next(nullptr), prev(nullptr)
{
}
 
Node::Node() : product(nullptr), count(0), next(nullptr), prev(nullptr)
{
}
 
Node* MyList::repeat_check(const Product* product)
{
    Node* tmp = head;
    while (tmp)
    {
        if (*tmp->product == *product)
            return tmp;
        tmp = tmp->next;
    }
    return nullptr;
}
 
void MyList::swap_p(Node* left, Node* right)
{
    Node* tmp = new Node();
    tmp->next = left->next;
    tmp->prev = left->prev;
    if (head == left)
        head = right;
    if (tail == right)
        tail = left;
    left->next = right->next;
    left->prev = right->prev;
    right->next = tmp->next;
    right->prev = tmp->prev;
    delete tmp;
}
 
MyList::MyList() : head(nullptr), tail(nullptr), size(0)
{
}
 
void MyList::push_back(const Product* product)
{
    Node* tmp = new Node(const_cast<Product*>(product));
    if (!size)
    {
        head = tmp;
        tail = tmp;
        size++;
    }
    else
    {
        Node* check;
        if (check = repeat_check(product))
        {
            check->count++;
        }
        else
        {
            tail->next = tmp;
            tmp->prev = tail;
            tail = tmp;
            size++;
        }
    }
}
 
void MyList::clear()
{
    Node* tmp = head, * deleted;
    while (tmp)
    {
        deleted = tmp;
        tmp = tmp->next;
        delete deleted;
    }
}
 
void MyList::print_all() const
{
    Node* tmp = head;
    while (tmp)
    {
        cout << tmp->product->GetName() << "\t" << tmp->product->GetCost() << "\t" << tmp->product->GetWeight() << "\t" << tmp->count << endl;
        tmp = tmp->next;
    }
}
 
void MyList::sort_by_name()
{
    if (size < 2)
        return;
    Node* tmp1 = head, *tmp2 = head->next;
    while (tmp1 && tmp2)
    {
        if (tmp1->product->GetName() < tmp2->product->GetName())
            swap_p(tmp1, tmp2);
        tmp1 = tmp1->next;
        tmp2 = tmp2->next;
    }
}
 
void MyList::sort_by_cost()
{
}
 
MyList::~MyList()
{
    clear();
}

#pragma once
#include "Product.h"
struct Node;
class MyList
{
    Node* head, * tail;
    size_t size;
    Node* repeat_check(const Product* product);
    void swap_p(Node* left, Node* right);
public:
    MyList();
    void push_back(const Product* product);
    void clear();
    void print_all() const;
    void sort_by_name();
    void sort_by_cost();
    ~MyList();
};