[STL] algorithm 내부 sort 함수의 원형

Sort의 원형이다.

한번 고민해 봐야 할 것 같다.

void _Sort(_RanIt _First, _RanIt _Last, _Diff _Ideal, _Pr _Pred)
{    // order [_First, _Last), using _Pred
    
    _Diff _Count;
    
    for (; _ISORT_MAX < (_Count = _Last - _First) &amp; &amp; 0 < _Ideal;)
    {    // divide and conquer by quicksort
        pair<_RanIt, _RanIt> _Mid =
            _Unguarded_partition(_First, _Last, _Pred);
        
        _Ideal /= 2;
        _Ideal += _Ideal / 2;    // allow 1.5 log2(N) divisions
 
        if (_Mid.first - _First < _Last - _Mid.second)
        {    // loop on second half
            _Sort(_First, _Mid.first, _Ideal, _Pred);
            _First = _Mid.second;
        }
        else
        {    // loop on first half
            _Sort(_Mid.second, _Last, _Ideal, _Pred);
            _Last = _Mid.first;
        }
    }
 
    if (_ISORT_MAX < _Count)
    {    // heap sort if too many divisions
        _STD make_heap(_First, _Last, _Pred);
        _STD sort_heap(_First, _Last, _Pred);
    }
    else if (1 < _Count)
        _Insertion_sort(_First, _Last, _Pred);    // small
}