Forum: Ruby Help on algorythm

Announcement (2017-05-07): www.ruby-forum.com is now read-only since I unfortunately do not have the time to support and maintain the forum any more. Please see rubyonrails.org/community and ruby-lang.org/en/community for other Rails- und Ruby-related community platforms.
Helder O. (Guest)
on 2008-12-09 16:51
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 :)
Glen H. (Guest)
on 2008-12-09 17:04
(Received via mailing list)
On Tue, Dec 9, 2008 at 7:44 AM, Helder O.
<removed_email_address@domain.invalid>wrote:

>
> Need a little help with this guys :)
>
>
> Note: this is not for a school work or project :)
> --
> Posted via http://www.ruby-forum.com/.
>
>
http://www.google.com/search?hl=en&q=Ruby+permutat...

--
"Hey brother Christian with your high and mighty errand, Your actions
speak
so loud, I can't hear a word you're saying."

-Greg Graffin (Bad Religion)
Gregory B. (Guest)
on 2008-12-09 17:16
(Received via mailing list)
On Tue, Dec 9, 2008 at 9:56 AM, Glen H. <removed_email_address@domain.invalid>
wrote:

> http://www.google.com/search?hl=en&q=Ruby+permutat...

Oh come on, we can do better than that:
http://tinyurl.com/57769d

---
Technical Blaag at: http://blog.majesticseacreature.com
 Non-tech stuff at: http://metametta.blogspot.com
"Ruby Best Practices"  Book now in O'Reilly Roughcuts:
http://rubybestpractices.com
Helder O. (Guest)
on 2008-12-09 17:19
ok ok,
sorry guys for the question, and thanks for the replys ;)
Robert D. (Guest)
on 2008-12-09 17:24
(Received via mailing list)
On Tue, Dec 9, 2008 at 4:08 PM, Gregory B.
<removed_email_address@domain.invalid> wrote:
> On Tue, Dec 9, 2008 at 9:56 AM, Glen H. <removed_email_address@domain.invalid> wrote:
>
>> http://www.google.com/search?hl=en&q=Ruby+permutat...
>
> Oh come on, we can do better than that:
> http://tinyurl.com/57769d
and who is going to click on the links for me? Read the stuff? and
explain it to me?
Chris L. (Guest)
on 2008-12-09 17:31
Gregory B. 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 :) !

Chris
pat eyler (Guest)
on 2008-12-09 17:39
(Received via mailing list)
On Tue, Dec 9, 2008 at 8:08 AM, Gregory B.
<removed_email_address@domain.invalid> wrote:
> On Tue, Dec 9, 2008 at 9:56 AM, Glen H. <removed_email_address@domain.invalid> wrote:
>
>> http://www.google.com/search?hl=en&q=Ruby+permutat...
>
> Oh come on, we can do better than that:
> http://tinyurl.com/57769d

Gregory, I can't believe you'd use some url shortener of questionable
language choices, surely http://rubyurl.com/ltJs is a better option.
Robert D. (Guest)
on 2008-12-09 17:42
(Received via mailing list)
On Tue, Dec 9, 2008 at 4:24 PM, Chris L. <removed_email_address@domain.invalid>
wrote:
> Gregory B. 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.

--
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.

Umberto Eco
James G. (Guest)
on 2008-12-09 17:45
(Received via mailing list)
On Dec 9, 2008, at 9:29 AM, pat eyler wrote:

> Gregory, I can't believe you'd use some url shortener of questionable
> language choices, surely http://rubyurl.com/ltJs is a better option.

The hilarious site Greg used has the other option built-in.  :(  We
should lobby them for RubyURL support.

James Edward G. II
Glen H. (Guest)
on 2008-12-09 17:50
(Received via mailing list)
On Tue, Dec 9, 2008 at 8:33 AM, Robert D. <removed_email_address@domain.invalid>
wrote:

> R.
>
>
Good point he didn't specifically state that position mattered and did
actually say combination, oh well my bad ;)

--
"Hey brother Christian with your high and mighty errand, Your actions
speak
so loud, I can't hear a word you're saying."

-Greg Graffin (Bad Religion)
Ken B. (Guest)
on 2008-12-09 19:40
(Received via mailing list)
On Tue, 09 Dec 2008 09:44:23 -0500, Helder O. wrote:

>
> Need a little help with this guys :)
>
>
> Note: this is not for a school work or project :)

In Ruby 1.8.7

numberset=(1..12).to_a

(5..7).each do |combination_size|
  numberset.combination(combination_size).do_something_with_it
end
Chris L. (Guest)
on 2008-12-09 19:41
> 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!

Chris
Robert D. (Guest)
on 2008-12-09 21:31
(Received via mailing list)
On Tue, Dec 9, 2008 at 6:34 PM, Chris L. <removed_email_address@domain.invalid>
wrote:

Ai ges U R rite ;).
Indeed I think you made a good point.
R.
This topic is locked and can not be replied to.