"Name","Input ranges*","Accumu­lator","Output ranges","Operations†","Default operations","Compl­exity","Order‡","Compare to"
"transform_inclusive_scan",1,"First, Arg",1,"aR, uT",,"O(N)","∥",
"transform_exclusive_scan",1,"Arg",1,"aR, uT",,"O(N)","∥",
"partial_sum",1,"First",1,"A","plus","O(N), =(N - 1)","Fwd.",
"inclusive_scan",1,"First, Arg",1,"aR","plus","O(N)","∥",
"exclusive_scan",1,"Arg",1,"aR","plus","O(N)","∥",
"adjacent_difference","1s","Quasi",1,"fD","minus","O(N), =(N - 1)","Fwd.∥","adjacent_transform"
"adjacent_transform▸","1s","Quasi",1,"D",,"O(N), =(N - 1)","Fwd.∥","adjacent_difference"
"adjacent_inclusive_scan▸","1s","First",1,"A, D",,"O(N)","Fwd.",
"transform","1 / 2",,1,"uT / bT",,"=(n)","∥",
"copy, copy_n",1,,1,,,"=(n)","Fwd.∥","transform"
"copy_backward",1,,1,,,"=(n)","Rev.",
"move",1,,1,,,"=(n)","Fwd.∥","shift_left"
"move_backward",1,,1,,,"=(n)","Rev.","shift_right"
"replace_copy","1+Value","Arg",1,,"equal_to","=(n)","Fwd.∥","transform"
"replace_copy_if",1,"Arg",1,"uP",,"=(n)","Fwd.∥","transform"
"reverse_copy",1,,1,,,"=(n)","∥","transform"
"rotate_copy","1d",,1,,,"O(N)","∥",
"sample",1,"Arg",1,,,"O(N)","Fwd.",
"partial_sort_copy",1,,1,"bP","less","O(N log(min(D,N))","∥",
"partition_copy",1,,2,"uP",,"=(n)","Fwd.∥",
"transform_if",1,,1,"uP, uT",,"O(N)","Fwd.",
"copy_if, remove_copy_if",1,,1,"uP",,"O(N)","Fwd.∥","transform_if"
"remove_copy","1+Value",,1,,"equal_to","=(n)","Fwd.∥","transform_if"
"unique_copy",1,"First",1,"bP","equal_to","O(N)","Fwd.∥",
"set_difference, set_intersection, set_symmetric_difference, set_union",2,,1,"bP","less","O(N+M), ≤(2⋅(N+M)−1)","Fwd.∥",
"merge",2,,1,"bP","less","O(N+M)","Fwd.∥",
"regex_replace⧫",2,,1,"Regex⧫",,"Unspc.",,"See note⧫"
"search_replace_copy",3,,1,"bP","equal_to","O(N×(S+R))",,"regex_replace⧫"
"generate, generate_n",0,,1,"G",,"=(n)","Fwd.∥",
"iota",0,"Arg",1,,"++","=(n)","Fwd.","generate"
"iota",0,"Arg",1,"uT","++","=(n)","Fwd.","generate"
"fill, fill_n",0,"Arg",1,,,"=(n)","Fwd.∥","generate, generate_n"
"for_each, for_each_n",1,,"0∅","muT",,"=(n)","Fwd.∥",
"for_each, for_each_n","1 / 2",,"0∅","muT / mbT",,"=(n)","Fwd.",
"swap_ranges",2,,"Self",,"swap","O(N)","Fwd.∥","for_each"
"remove","1+Value",,"Self",,"equal_to","O(N)","Fwd.∥",
"remove_if",1,,"Self","uP",,"O(N)","Fwd.∥",
"unique",1,,"Self","bP","equal_to","O(N)","Fwd.∥",
"replace","1+Value",,"Self",,"equal_to","=(n)","Fwd.∥","transform"
"replace_if",1,,"Self","uP",,"=(n)","Fwd.∥","transform"
"reverse",1,,"Self",,,"O(N), =(N/2)","Yes∥","swap_ranges"
"rotate","1d",,"Self",,,"O(N)","Yes∥",
"shift_left","1d",,"Self",,,"≤(N-n)","Fwd.∥","move"
"shift_right","1d",,"Self",,,"≤(N-n)","Yes∥","move_backward"
"shuffle","1+URBG",,"Self",,,"O(N)",,
"next_permutation, prev_permutation",1,,"Self",,,"O(N), ≤(N/2)",,
"partition",1,,"Self","uP",,"O(N); O(N log N)↓∥","∥",
"stable_partition",1,,"Self","uP",,"O(N) w/ memory, else O(N log N); O(N log N)↓∥","∥",
"sort",1,,"Self","bP","less","O(N log N)","∥",
"partial_sort",1,,"Self","bP","less","O(N log M)","∥",
"stable_sort",1,,"Self","bP","less","O(N log N) w/ memory, else O(N log(N)2)","∥",
"nth_element",1,,"Self","bP","less","O(N); O(N log N)↓∥","∥",
"make_heap",1,,"Self","bP","less","O(N), ≤(3N)",,
"push_heap, pop_heap",1,,"Self","bP","less","O(log N)",,
"sort_heap",1,,"Self","bP","less","O(N log N)",,
"inplace_merge","1d",,"Self","bP","less","=(N-1) w/ memory, O(N log N); O(N log N)↓∥","∥",