A point in a domain where the function value is lower than at neighboring points, so it's not the lowest point in the domain but locally it appears to be.
"Optimization algorithms often seek to avoid getting stuck in local minima when searching for a global minimum."
A classic problem in combinatorial optimization and computer science where the goal is to find the shortest possible route that visits each city exactly once and returns to the origin city.
"The traveling salesman problem is an NP-hard problem with many real-world applications."
A data structure that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node.
"Binary trees are used in computer science for searching and sorting data efficiently."
A function defined without a name, often used as an argument to other functions.
"Anonymous functions in JavaScript are commonly used for callbacks and event handlers."
In programming, a type relationship where a type can be used in place of another type if it is a supertype of that type, opposite of covariance.
"Contravariance is often used in the context of function argument types, where a function can accept arguments of a more generic type than specified."