Java generic Iterator implementation to generate permutations and combinations.

Uses the algorithm described here http://en.wikipedia.org/wiki/Steinhaus%E2%80%93Johnson%E2%80%93Trotter_algorithm#Even.27s_speedup and the clear description of that algorithm here: http://www.cut-the-knot.org/Curriculum/Combinatorics/JohnsonTrotter.shtml

Features

  • Iterator going through all permutations of elements in a Collection
  • Iterator going through all pair wise swaps required to generate all permutations
  • Iterator generating all combinations of elements in a Collection
  • All strongly typed by using generic type (Iterator<T>)

Project Activity

See All Activity >

Categories

Algorithms, Libraries

License

BSD License

Follow SwapPermutationsIterator

SwapPermutationsIterator Web Site

Other Useful Business Software
Stop vibe-debugging. Icon
Stop vibe-debugging.

Plug Claude into your app's actual errors.

AppSignal's MCP server hands Claude, Cursor, or Zed your real errors, traces, and the deploy that shipped them. AI writes the fix; you review the diff.
Free 30 days.
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of SwapPermutationsIterator!

Additional Project Details

Intended Audience

Developers

Programming Language

Java

Related Categories

Java Algorithms, Java Libraries

Registered

2012-12-19