Re: [OT] Question about performance with last array

--- Ashish Kulkarni wrote: > i have to find the shortest distance to travel, but > this is not as simple as travel sales man problem > because A-B is not as same as B-C That *is* the traveling salesman problem. There are many homework and algorithm sites that can help you, and googling for vario

Re: [OT] Question about performance with last array

Hi This is what i have to do, suppose have 3 points A-B-C then i have to find the shortest distance to travel, but this is not as simple as travel sales man problem because A-B is not as same as B-C So suppose i have A-B is 2 A-C is 1 B-A is 3 B-C is 2 C-A is 4 C-B is 3 then i have find what is the

Re: [OT] Question about performance with last array

2007/8/10, Ashish Kulkarni <[EMAIL PROTECTED]>: > Hi > I have a program which creates permutations for 10 letters, so the values i > get is 10 ^10 which is more then 3 million Do you mean permutations (the same letters ordered in different ways) or dispositions with repetition (the 10-letter group

[OT] Question about performance with last array

Hi I have a program which creates permutations for 10 letters, so the values i get is 10 ^10 which is more then 3 million Now i have to go through all 3 million records and do some calculations to determine the best possible combination . Any ideas what i should use, LinkedList, ArrayList, HashMap