STL算法

1、非修正序列算法

adjacent_find(first, last)	count(first, last, value)	equal(first,last,value)	find(first,last,value)
find_first(first,last,first2,last2)	find_end(first,last,first2,last2)	for_each(first, last, func)	mismatch(first, last, first2)
search(first, last,first2,last2)

 

2、修正序列算法

copy(first, last, first2)	copy_backward(first, last, first2)	fill(first, last, value)	generate(first, last, function)
Partition(first,last,pred)	random_shuffle(first, last)	remove(first, last, value)	replace(first, last,value1, value2)
rotate(first,middle, last)	reverse(first, last)	swap(it1,it2)	swap_ranges(first, last, first2)
transform(first, last,first2,func)	unique(first, last)

 

3、排序算法

binary_search(first, last,value)	equal_range(first, last,value)	includes(first, last,first2, last2)	lexicographicical_compare (first, last,first2,last2)
lower_bound(first, last,value)	make_heap(first,last)	max(value1, value2)	max_element(first, last)
merge(first, last, first2, last2,result)	min(value1, value2)	min_element(first, last)	next_permutation(first, last)
nth_element(first, nth, last)	partial_sort_copy(first, last,first2, last2)	partial_sort(first, middle, last)	pop_heap(first, last)
prev_permutation(first, last)	push_heap(first, last)	set_difference(first, last,first2,last2,result)	set_intersection(first, last,first2,last2,result)
sort(first, last)	sort_heap(first,last)	set_union(first, last,first2,last2,result)	set_symmetricdifference(first, last,first2,last2,result)
stable_sort(first, last)	upper_bound(first, last, value)

 

4、数值算法

accumulate(first, last, init)	inner_product(first, last, first2, init)	partial_sum(first, last, result)	adjacent_difference(first, last,result)
iota(first, last,value)