lower_ Personal understanding of bound function

0. Official documents
1. The header file #include< algorithm >
2. Functions and parameters ：

lower_bound(first ,last, val)

first： The first address of the array of actions

last： The next address of the last position of the active array

val： To insert the elements of an array

3. Array range of action ：[first,last)
4. Return value ： Returns greater than or equal to val The first element position of . If all elements are less than val, Then return to last The location of , And last My position is beyond the boundary .
5. effect ： Personal understanding , At present and vector Use together to input , You can sort the array in the input loop .

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
    
	int n = 6;
	int i = 0;
	vector<int> v;
	int data;
	cout << " Input ：";
	for (i; i < n; i++) {
    
		cin >> data;
		v.insert(lower_bound(v.begin(), v.end(), data), data);
	}
	cout << " Output ：";
	for (i = 0; i < n; i++) {
    
		cout << v[i] << " ";
	}
}

6. Compare ：STL Of set You can also do automatic sorting , however set The sorting of cannot be repeated , This function can be used to sort data containing duplicates , Change the function from small to large ,upper_bound() You can sort from large to small , The parameters are consistent with those described in the article