Java Glossary : combinations

CMP home Java glossary home Menu no menu Last updated 2004-06-28 by Roedy Green ©1996-2004 Canadian Mind Products

Java definitions: 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

You are here : home : Java Glossary : C words : combinations.

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 combinatons, 1=present 0=absent.

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


CMP logo
CMP_home
home
Canadian Mind Products CSS
HTML Checked!
ICRA ratings logo
mindprod.com IP:[24.87.56.253]
Your IP:[80.134.30.163]
You are visitor number 1170.
Please send errors, omissions and suggestions
to improve this page to Roedy Green.
You can get a fresh copy of this page from: or possibly from your local J: drive mirror:
http://mindprod.com/jgloss/combination.html J:\mindprod\jgloss\combination.html