算法 | Algorithm 目录 Algorithms library std::accumulate std::adjacent_difference std::adjacent_find std::all_of std::any_of std::binary_search std::bsearch std::clamp std::copy std::copy_backward std::copy_if std::copy_n std::count std::count_if std::equal std::equal_range std::exclusive_scan std::execution::par std::execution::parallel_policy std::execution::parallel_unsequenced_policy std::execution::par_unseq std::execution::seq std::execution::sequenced_policy std::fill std::fill_n std::find std::find_end std::find_first_of std::find_if std::find_if_not std::for_each std::for_each_n std::generate std::generate_n std::includes std::inclusive_scan std::inner_product std::inplace_merge std::iota std::is_execution_policy std::is_heap std::is_heap_until std::is_partitioned std::is_permutation std::is_sorted std::is_sorted_until std::iter_swap std::lexicographical_compare std::lower_bound std::make_heap std::max std::max_element std::merge std::min std::minmax std::minmax_element std::min_element std::mismatch std::move std::move_backward std::next_permutation std::none_of std::nth_element std::partial_sort std::partial_sort_copy std::partial_sum std::partition std::partition_copy std::partition_point std::pop_heap std::prev_permutation std::push_heap std::qsort std::random_shuffle std::reduce std::remove std::remove_copy std::remove_copy_if std::remove_if std::replace std::replace_copy std::replace_copy_if std::replace_if std::reverse std::reverse_copy std::rotate std::rotate_copy std::sample std::search std::search_n std::set_difference std::set_intersection std::set_symmetric_difference std::set_union std::shuffle std::sort std::sort_heap std::stable_partition std::stable_sort std::swap std::swap_ranges std::transform std::transform_exclusive_scan std::transform_inclusive_scan std::transform_reduce std::unique std::unique_copy std::upper_bound
在线文档教程