Guys i have been trying to make this algorythm but with no sucess, can
you help me out ?
The problem is the follow
for the following numberset like 1,2,3,4,5,6,7,8,9,10,11,12 i need to
take all the five number combinations, six number combinations and the
seven number combinations, this cant be "hardcoded", this need to be
flexible because at any time i may need all the 3 number combinations
and later i may need numbersets of 15 or even more.
On Tue, Dec 9, 2008 at 7:44 AM, Helder Oliveira <hrpoliveira@gmail.com>wrote:
Guys i have been trying to make this algorythm but with no sucess, can
you help me out ?
The problem is the follow
for the following numberset like 1,2,3,4,5,6,7,8,9,10,11,12 i need to
take all the five number combinations, six number combinations and the
seven number combinations, this cant be "hardcoded", this need to be
flexible because at any time i may need all the 3 number combinations
and later i may need numbersets of 15 or even more.
(5..7).each do |combination_size|
numberset.combination(combination_size).do_something_with_it
end
···
On Tue, 09 Dec 2008 09:44:23 -0500, Helder Oliveira wrote:
Guys i have been trying to make this algorythm but with no sucess, can
you help me out ?
The problem is the follow
for the following numberset like 1,2,3,4,5,6,7,8,9,10,11,12 i need to
take all the five number combinations, six number combinations and the
seven number combinations, this cant be "hardcoded", this need to be
flexible because at any time i may need all the 3 number combinations
and later i may need numbersets of 15 or even more.
Need a little help with this guys
Note: this is not for a school work or project
--
Chanoch (Ken) Bloom. PhD candidate. Linguistic Cognition Laboratory.
Department of Computer Science. Illinois Institute of Technology. http://www.iit.edu/~kbloom1/
Of course, this assumes that one knows the meaning of the English word
Permutations. I'm not sure if this was the case or not with the original
poster, perhaps he wasn't simply being lazy !
Of course, this assumes that one knows the meaning of the English word
Permutations. I'm not sure if this was the case or not with the original
poster, perhaps he wasn't simply being lazy !
--
Il computer non è una macchina intelligente che aiuta le persone
stupide, anzi, è una macchina stupida che funziona solo nelle mani
delle persone intelligenti.
Computers are not smart to help stupid people, rather they are stupid
and will work only if taken care of by smart people.
Good point he didn't specifically state that position mattered and did
actually say combination, oh well my bad
···
On Tue, Dec 9, 2008 at 8:33 AM, Robert Dober <robert.dober@gmail.com> wrote:
On Tue, Dec 9, 2008 at 4:24 PM, Chris Lowis <chris.lowis@gmail.com> wrote:
> Gregory Brown wrote:
>> Oh come on, we can do better than that:
>> http://tinyurl.com/57769d
>
> Of course, this assumes that one knows the meaning of the English word
> Permutations. I'm not sure if this was the case or not with the original
> poster, perhaps he wasn't simply being lazy !
Oh he did not ask for permutations, he asked for combinations, are we
being unfriendly?
R.
--
"Hey brother Christian with your high and mighty errand, Your actions speak
so loud, I can't hear a word you're saying."
Oh he did not ask for permutations, he asked for combinations, are we
being unfriendly?
No, not at all. I was simply making the observation that selecting the
correct (often English due to the availability of material in that
language) word can open a goldmine of results in Google searches.
Sometimes all one can do is explain a concept, because one doesn't have
the vocabulary to reduce it to a single, searchable word.
At least, that's been my experience with the non-native languages I
speak poorly, and I'm counting mathematics as one of those languages
here!
We should lobby them for RubyURL support.