A few notes on the standard sort algorithm

• We will be studying sorting in much more detail later.
• But the standard algorithm library includes a sort function.
• sort(iterator to first element, iterator to one past last)
• sort(iterator to first element, iterator to one past last, pointer to compare function)
• In either case, the compare function is expected to be
• bool operator <(const & itemType a , const & itemType b)
• Here is an example.