combinations : Java Glossary

home page go to the Java Glossary Home go to the Computer Buyer’s Glossary up jump to foot of page Google search web for more information on this topic Pinterest pin button
* 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z (all)
©1996-2017 2008-04-02 Roedy Green of Canadian Mind Products
The JDisplay Java Applet displays the large program listings on this web page. JDisplay requires an up-to-date browser and Java version 1.8+, preferably 1.8.0_131. If you can’t see the listings, or if you just want to learn more about JDisplay, click  Help Use Firefox for best results.

combinations
If you have a set of objects and select some of them, that selection without regard to their order is called a combination. If you have n objects there are 2n (2 to the nth power) possible combinations ranging from none present to all present. If you consider all the binary numbers ranging from 0 to 2n-1 and look at the individual bits, they map the possible combinations, 1=present 0=absent. So to generate all possible 16-bit quantities just use a for loop, for ( int i=0; i < 65535; i++).
Example Sample Code Links

Example

E.g what are the possible combinations of three objects a b c:
0 000 _
1 001 c
2 010 b
3 011 bc
4 100 a
5 101 ac
6 110 ab
7 111 abc

Sample Code

Here is an implementation of the Dijkstra algorithm for permutations and also a combinations algorithm: view

This page is posted
on the web at:

 http://mindprod.com/jgloss/combination.html

Optional Replicator mirror
of mindprod.com
on local hard disk J:

 J:\mindprod\jgloss\combination.html
Canadian Mind Products
Please the feedback from other visitors, or your own feedback about the site.
Contact Roedy. Please feel free to link to this page without explicit permission.

IP:[65.110.21.43]
Your face IP:[3.16.75.224]
You are visitor number