-
Notifications
You must be signed in to change notification settings - Fork 150
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Improve subset creation method #798
Comments
jenetics
added a commit
that referenced
this issue
Sep 9, 2021
jenetics
added a commit
that referenced
this issue
Sep 9, 2021
Sub-set performance before improvements
|
Sub-set performance after improvements
|
jenetics
added a commit
that referenced
this issue
Sep 13, 2021
jenetics
added a commit
that referenced
this issue
Sep 13, 2021
jenetics
added a commit
that referenced
this issue
Sep 13, 2021
jenetics
added a commit
that referenced
this issue
Sep 13, 2021
jenetics
added a commit
that referenced
this issue
Sep 13, 2021
jenetics
added a commit
that referenced
this issue
Sep 14, 2021
jenetics
added a commit
that referenced
this issue
Sep 15, 2021
|
jenetics
added a commit
that referenced
this issue
Sep 16, 2021
…ovement #798: Combinatorics::subset performance improvement
Merged into r7.0.0 branch. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
The algorithm for creating a random sub-set from a given base-set is an essential part of the GA. It implements the
RANKSB
algorithm described by Albert Nijenhuis and Herbert Wilf in Combinatorial Algorithms for Computers and Calculators, Second Edition, Academic Press, 1978, ISBN: 0-12-519260-6, Page: 42. The algorithm has a runtime complexity of O(k) for k <= n/2, where k is the size of the random sub-set to create and n the size of the base set.The algorithm should be optimized to calculate the inverted sub-set for k > n. For k > n/2 the runtime complexity is no longer linear with k.
The text was updated successfully, but these errors were encountered: