C++ stable_sort()用法及代碼示例

// C++ program to demonstrate default behaviour of 
// sort() in STL. 
#include <bits/stdc++.h> 
using namespace std; 
  
int main() 
{ 
    int arr[] = { 1, 5, 8, 9, 6, 7, 3, 4, 2, 0 }; 
    int n = sizeof(arr) / sizeof(arr[0]); 
  
    stable_sort(arr, arr + n); 
  
    cout << "\nArray after sorting using "
            "default sort is:\n"; 
    for (int i = 0; i < n; ++i) 
        cout << arr[i] << " "; 
  
    return 0; 
}

// C++ program to demonstrate descending order 
// stable sort using greater<>(). 
#include <bits/stdc++.h> 
using namespace std; 
  
int main() 
{ 
    int arr[] = { 1, 5, 8, 9, 6, 7, 3, 4, 2, 0 }; 
    int n = sizeof(arr) / sizeof(arr[0]); 
  
    stable_sort(arr, arr + n, greater<int>()); 
  
    cout << "Array after sorting:\n"; 
    for (int i = 0; i < n; ++i) 
        cout << arr[i] << " "; 
  
    return 0; 
}

// A C++ program to demonstrate STL stable_sort()  
// to sort intervals according to start time. 
// Given intervals are sorted according to 
// ending time 
#include <bits/stdc++.h> 
using namespace std; 
  
// An interval has start time and end time 
struct Interval { 
    int start, end; 
}; 
  
// Compares two intervals according to staring  
// times. 
bool compareInterval(Interval i1, Interval i2) 
{ 
    return (i1.start < i2.start); 
} 
  
int main() 
{ 
    // Given intervals are sorted according to end time 
    Interval arr[] = { {1, 3}, {2, 4}, {1, 7}, {2, 19} }; 
    int n = sizeof(arr) / sizeof(arr[0]); 
  
    // sort the intervals in increasing order of 
    // start time such that the start time intervals 
    // appear in same order as in input. 
    stable_sort(arr, arr + n, compareInterval); 
  
    cout << "Intervals sorted by start time:\n"; 
    for (int i = 0; i < n; i++) 
        cout << "[" << arr[i].start << ", " << arr[i].end 
             << "] "; 
  
    return 0; 
}