Finding all possible combinations of numbers

[Mia]

Hi,

Any idea how to find all possible combinations of numbers of a chain of 4 numbers. (a lot of )

Example:

0123

0124

0125

0126

0127

...

and so on until 9999

Big thanks!

[jchd]

Do you mean 0 to 9999 or something else? As numbers (no leading zeros) or as strings? Which form should have the result: array or whatelse?

Try to use more precise terms else you'll get fuzzy/wrong anwsers.

Edited December 15, 2016 by jchd

[Mia]

2 minutes ago, jchd said:

Do you mean 0 to 9999 or something else? As numbers (no leading zeros) or as strings? Which form should have the result: array or whatelse?

Try to use more precise terms else you'll get fuzzy/wrong anwsers.

As strings.

Example: 0001 counts as 4 chars.

[iamtheky]

for $n = 0 to 9999
    msgbox(0, '' , StringFormat("%04i" , $n))
next

 

[Mia]

Results can simply be shown in console with ConsoleWrite to make it simple (sorry for the double post, can't find the edit button)

[SadBunny]

Here's another very fast algorithm:

#include <Array.au3>

Dim $aList[0]
Do
    $x = StringFormat("%04i", Random(0, 9999, 1))
    If _ArraySearch($aList, $x) == -1 Then
        ReDim $aList[UBound($aList)]
        _ArrayAdd($aList, $x)
    EndIf
Until UBound($aList) = 10000
_ArraySort($aList)
_ArrayDisplay($aList)

 

[Mia]

Thanks everyone!

[InunoTaishou]

Or this

#include <Array.au3>
Global $aNumbers[10000]

For $i = 0 to UBound($aNumbers) - 1
    $aNumbers[$i] = StringFormat("%04i", $i)
Next

_ArrayDisplay($aNumbers)

 

[RTFC]

Also check out _ArrayPermute.

8 hours ago, SadBunny said:

another very fast algorithm

@SadBunny: ReDim inside a loop is actually slowing the script down needlessly. Instead, I would just allocate the array once outside the loop and apply an upper bound in _ArraySearch that increments on successive iterations.

[kylomas]

@RTFC -

16 minutes ago, RTFC said:

another very fast algorithm

That may have been "tongue in cheek".  Note the random list that is generated, then sorted.

kylomas

[RTFC]

12 minutes ago, kylomas said:

That may have been "tongue in cheek".

@kylomas: I think we need an emoji for that. I missed that, and maybe the OP would too.

Edited December 16, 2016 by RTFC

[SadBunny]

No, RTFC is right. The untold millions of random numbers that the script searches the array for would be much faster inserted in that array, had it not to redim the array ten thousand times 

The speed difference between iamtheky's slow and inefficient procedure and my much superior solution using RNG and array manipulation (which if nothing else at least sounds more Random (1337,1337,1)...) should be immediately clear when running both scripts.

[iamtheky]

That is barely passable as prng, and the speed difference is only evident because I msgbox the return.  At some point you have to loop through contents and format strings, any hopes of being superior at that are delusional.

[mikell]

3 hours ago, kylomas said:

3 hours ago, RTFC said:

another very fast algorithm

That may have been "tongue in cheek".  Note the random list that is generated, then sorted.

kylomas

+1

_ArraySearch + ReDim + _ArrayAdd = HighSpeed (well known)

[SadBunny]

41 minutes ago, mikell said:

_ArraySearch + ReDim + _ArrayAdd = HighSpeed (well known)

See? Thanks. Finally someone who understands. The proof of the pudding is in the selection of random pudding molecules and then eating them, but only if they don't equal any of the molecules you have already eaten.

[iamtheky]

ahh, the Bayesian solution to the ever difficult maths problem of N + 1

[kylomas]

Ok, bars open.  All y'all need a drinkl!

[czardas]

StringFormat() is slightly slower than concatenation:
$number = StringTrimLeft('000' &  $number, 4).

Edited December 16, 2016 by czardas

[iamtheky]

wouldnt you want to stringright, 4?

Edited December 16, 2016 by iamtheky

[jchd]

You were talking to @sadrazc, right?