all (3 digits permutations) of array with n elements

[Tommy98]

thank you it is finished

[MiiNiPaa]

If you would just stop answering in existin thread and just start new one ach day you are unlikely to find help. If you managed to make step1 work, you are now ready to step2 which includes repeat reducing optimisation called "don't look back", but I am not going to explain it in this thread.

[Tommy98]

anyway thanks

[MiiNiPaa]

the thing u said me did just the permutations of first 3 elements it didnot go throught array , i need 3 digit permutations from the whole array ,

The code you posted here does select permutations from whole array, assuming that you did everything else properly. If size is indeed size of array, and your fitness function is correct it should work:
http://coliru.stacked-crooked.com/a/85223d05109948ec
(example fitness function does not check if it is possible to create triangle from sizes)

If it does not, you did something wrong.