Stl Algorithms - C P P
#include <algorithm> => Library to includebinary_search(var.begin(), var.end(), val) => Returns boolean value true if the given value if present in the given vector- lower_bound(var.begin(), var.end(), val) - var.begin() => Returns lower bound iterator to the given value
- upper_bound(var.begin(), var.end(), val) - var.begin() => Returns upper bound iterator to the given value
max(val1, val2) => Returns max of bothmax({val1, val2, val3}) => Returns max or more than 2 values without doing multiple max functionmin(val1, val2) => Returns minimum of bothswap(var1, var2) => Swaps value of both variablesreverse(var.begin(), var.end()) => Reverses the given stringrotate(var.begin(), var.begin() + 1, var.end()) => Rotates elements, Given start value, number of elements to rotate and end valuelower_bound(var.begin(), var.end()) => Sorts the vector using intro sort method which is a combination of quick sort, heap sort, insertion sortsqrt(n) => Find square root of the numbersqrtl(n)