Chapter 13: Generic Algorithms

• Overview
• Include Files
• Initialization Algorithms
• Fill a Sequence with An Initial Value
• Copy One Sequence Into Another Sequence
• Initialize a Sequence with Generated Values
• Swap Values from Two Parallel Ranges
• Searching Operations
• Find an Element Satisfying a Condition
• Find Consecutive Duplicate Elements
• Find a Subsequence within a Sequence
• Locate Maximum or Minimum Element
• Locate the First Mismatched Elements in Parallel Sequences
• In-Place Transformations
• Reverse Elements in a Sequence
• Replace Certain Elements With Fixed Value
• Rotate Elements Around a Midpoint
• Partition a Sequence into Two Groups
• Generate Permutations in Sequence
• Merge Two Adjacent Sequences into One
• Randomly Rearrange Elements in a Sequence
• Removal Algorithms
• Remove Unwanted Elements
• Remove Runs of Similar Values
• Scalar-Producing Algorithms
• Count the Number of Elements that Satisfy a Condition
• Reduce Sequence to a Single Value
• Generalized Inner Product
• Test Two Sequences for Pairwise Equality
• Lexical Comparison
• Sequence-Generating Algorithms
• Transform One or Two Sequences
• Partial Sums
• Adjacent Differences
• Miscellaneous Algorithms
• Apply a Function to All Elements in a Collection