c++ stable sort, unstable sort

stable sort : merge sort

unstable sort : quick, heap sort

 

코드 >>

#include <iostream>
#include <array>
#include <vector>
#include <algorithm>
 
// stable sort : merge
// unstable sort : quick, heap
struct Employee
{
    int age;
    char name;
};
bool operator< (const Employee& lhs, const Employee& rhs)
{
    return lhs.age < rhs.age;
}
int main()
{    
    //stable sort -> merge
    // unstable sort -> quick, heap
    std::array<int, 7> nums = { 0,1,2,3,4,5,6 };
    for (auto k : nums)
    {
        std::cout << k << std::endl;
    }
 
    std::vector<Employee> v{
        {200,'A'},
        {200,'B'},
        {200,'C'},
        {200,'D'},
        {200,'E'}
    };
 
    for (int i = 9; i < 100; i++)
    {
        v.emplace_back(Employee{ i,'Z' });
    }
 
    std::sort(v.begin(), v.end());
    for (const Employee& e : v)
    {
        std::cout << e.age << ", " << e.name << std::endl;
    }
    //std::stable_sort(v.begin(), v.end());
    //for (const Employee& e : v)
    //{
    //    std::cout << e.age << ", " << e.name << std::endl;
    //}
    // 둘 다 결과가 다르다.
    
 
    return 0;
}