Рассортировать элементы в структуре в алфавитном порядке

#include <iostream>
#include <cmath>
using namespace std;
struct books;
{
char name[20];
int quantity;
};
int main()
{
setlocale(LC_ALL, "Rus");
books emp_1;
for (int i = 0; i < 5; i++)
{
for (int j = 0; j < 5; j++)
{
if (strcmp(emp_1[i].name, emp__1[i].name) > 0)
{
books tmp = emp_1[i];
emp_1[i] = emp_1[i];
emp_1[j] = emp_1[j];
}
}
}
{
for (int i = 0; i < 5; i++)
{
cout << "Enter the number of books: " << i + 1; emp_1[i].quantity;
cout << "Enter book titles: " << emp_1[i].name;
}
return 0;
 
}
}

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
 
struct Book {
    Book(const std::string& name): name{name} {}
    std::string name;
    bool operator < (const Book& right) const { return name < right.name; }
};
 
int main() {
    unsigned int n = 0;
    std::vector <Book> books;
    std::cout << "Enter number of books: ";
    std::cin >> n;
    std::cin.ignore();
    for (int i = 0; i < n; ++i) {
        std::string name;
        std::cout << "Enter name for book #" << i+1 << ": ";
        std::getline(std::cin, name);
        books.push_back(Book(name));
    }
    std::sort(books.begin(), books.end());
    for (auto &b: books) {
        std::cout << b.name << std::endl;
    }
}

#include <iostream>
#include <string>
using namespace std;
const int MAX_PTR_BOOK = 100;
struct Books
{   
    string NameBook;
    int Count;
};
void order(Books**, Books** );
int main() 
{
Books* ptrBook[MAX_PTR_BOOK];
int n = 0;
char choose;
do
{
ptrBook[n] = new Books;
cout << "Write book name "; cin >> ptrBook[n]->NameBook;
cout << "how many do you have copies of the book "; cin >> ptrBook[n]->Count;
++n;
cout << "do you want add another book ? y(yes) or any character to exit "; cin >> choose;
} while (choose == 'y');
for (int k = 0; k < n - 1; k++) {
    for (int j = k + 1; j < n; j++) {
        order(ptrBook + k, ptrBook + j);
 
    }
}
for (int i = 0; i < n; i++) {
    cout << "Book name " << ptrBook[i]->NameBook << " copies of the book " << ptrBook[i]->Count << endl;
    delete ptrBook[i];
}
}
void order(Books **ptrOne, Books** ptrTwo) 
{
    if ((*ptrOne)->NameBook > (*ptrTwo)->NameBook){
        Books* temp = *ptrTwo;
        *ptrTwo = *ptrOne;
        *ptrOne = temp;
    }
}