Merge и сортировка

#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
 
struct Entry
{
    long nr;
    char name[30];
 
    bool operator<(const Entry &entry)
    {
        return strcmp(name, entry.name) < 0;
    }
};
 
 
void PrintArray1DEntry(const char *info, const Entry *begin, const Entry *end);
 
 
int main()
{
    Entry  a[] = {{10, "Kate"}, {11, "Aleks"}, {80, "Irina"}};
    const int aSize = sizeof(a)/sizeof(a[0]);
 
    Entry b[] = {{16, "Sasha"}, {20, "Vlad"}, {25, "Vika"}};
    const int bSize = sizeof(b)/sizeof(b[0]);
 
    Entry c[aSize+bSize];
    const int cSize = sizeof(c)/sizeof(c[0]);
 
    std::merge(a, a+aSize,  b, b+bSize,  c);
 
    PrintArray1DEntry("c:", c, c+cSize);
 
    system("pause");
    return 0;
}
 
 
void PrintArray1DEntry(const char *info, const Entry *begin, const Entry *end)
{
    std::cout << info << std::endl;
 
    for (Entry const *i=begin; i!=end; i++)
        std::cout << "[" << i->nr << ", " << i->name << "]" << std::endl;
 
    std::cout << std::endl;
}