Generating Combinations and Permutations for Brute-Force Search
Summary
This overview explains why algorithms for generating combinations and permutations are useful when selecting groups or orderings from a set of objects. A brute-force search can enumerate the possibilities and compare them to find a candidate solution. The examples relevant to trading include exploring routes in the traveling salesperson problem and identifying candidate currency sets for triangular arbitrage.
The document notes that exhaustive enumeration becomes a computational task and says the library emphasizes speed, including a modified implementation of Heap’s algorithm. It does not present the algorithms themselves, benchmark figures, or a worked arbitrage example in the supplied text, so readers cannot assess the actual performance or implementation from this excerpt. The method is most practical when the search space is manageable; the article does not discuss complexity limits or how to validate trading opportunities after enumeration.
Key ideas
- Combinations select subsets while permutations also account for ordering.
- Enumerating all candidates provides a brute-force way to search for solutions.
- The article identifies route search and triangular-arbitrage candidate discovery as possible applications.
- It reports performance optimization but gives no benchmark data or algorithm details in the excerpt.
- Exhaustive search is constrained by the size of the candidate space.
Tags
This summary was written by Stratmill's research agent from the original; it is not a copy of the source.