11,719,973 members (84,316 online)

Algorithms

 Re: Splitting up multiple readings... glennPattonWork9-Oct-12 4:45 glennPattonWork 9-Oct-12 4:45
 Re: Splitting up multiple readings... Eddy Vluggen22-Oct-12 6:24 Eddy Vluggen 22-Oct-12 6:24
 Re: Puzzle 8 Solving with bfs Alan Balkany26-Sep-12 4:27 Alan Balkany 26-Sep-12 4:27
 Re: Puzzle 8 Solving with bfs Alan Balkany26-Sep-12 4:42 Alan Balkany 26-Sep-12 4:42
 Re: Puzzle 8 Solving with bfs Alan Balkany26-Sep-12 5:09 Alan Balkany 26-Sep-12 5:09
 Bit Interleaver Skippums24-Sep-12 16:07 Skippums 24-Sep-12 16:07
 Image processing fabio_antonio23-Sep-12 8:25 fabio_antonio 23-Sep-12 8:25
 Re: Image processing Alan Balkany24-Sep-12 4:46 Alan Balkany 24-Sep-12 4:46
 Checking the network en41115-Sep-12 7:24 en411 15-Sep-12 7:24
 linkRe: Checking the network YvesDaoust21-Sep-12 0:11 YvesDaoust 21-Sep-12 0:11
 Sorry, I see nothing difficult in this problem statement. Or maybe is it just that you never wrote a program ? Or are you asking how to represent the network topology and path costs ? For a), scan the array and check if two consecutive indexes are the same. For b), scan the array and check if every pair of indexes are linked in the user-supplied topology (you need some function that will query the topology and tell you if a link exists). For c), the condition is a[5] != 5. For d), use a double loop: the outer loop from i=1 to 4, the inner loop for j=i+1 to 5. In the body of the inner loop, test a[i] == a[j]. Accumulating the path costs is also obvious once you have a query function per network link.
 an optimal elevator-use algorithm BillWoodruff13-Sep-12 3:38 BillWoodruff 13-Sep-12 3:38
 Re: an optimal elevator-use algorithm Alan Balkany13-Sep-12 4:41 Alan Balkany 13-Sep-12 4:41
 Re: an optimal elevator-use algorithm BillWoodruff19-Sep-12 4:35 BillWoodruff 19-Sep-12 4:35
 Please, poke holes in my cryptographic function... SixOfTheClock13-Sep-12 0:52 SixOfTheClock 13-Sep-12 0:52
 What kind of checksum can this be? GrooverFromHolland9-Sep-12 9:18 GrooverFromHolland 9-Sep-12 9:18
 Re: What kind of checksum can this be? Alan N9-Sep-12 11:55 Alan N 9-Sep-12 11:55
 Re: What kind of checksum can this be? GrooverFromHolland9-Sep-12 22:15 GrooverFromHolland 9-Sep-12 22:15
 Linear Regression Most Efficient algorithm calc Line of Best Fit A*****4-Sep-12 19:24 A***** 4-Sep-12 19:24
 Re: Linear Regression Most Efficient algorithm calc Line of Best Fit Peter_in_27804-Sep-12 20:17 Peter_in_2780 4-Sep-12 20:17
 Re: Running out of Memory - Maths Check Andrei Straut3-Sep-12 9:03 Andrei Straut 3-Sep-12 9:03
 Re: Running out of Memory - Maths Check Andrei Straut3-Sep-12 10:56 Andrei Straut 3-Sep-12 10:56
 Re: Running out of Memory - Maths Check harold aptroot3-Sep-12 21:54 harold aptroot 3-Sep-12 21:54
 Re: Running out of Memory - Maths Check YvesDaoust3-Sep-12 23:21 YvesDaoust 3-Sep-12 23:21
 Re: Running out of Memory - Maths Check Member 91314964-Sep-12 1:56 Member 9131496 4-Sep-12 1:56
 Re: Running out of Memory - Maths Check Member 91314965-Sep-12 2:00 Member 9131496 5-Sep-12 2:00
 Re: Running out of Memory - Maths Check Jeremy David Thomson5-Sep-12 1:36 Jeremy David Thomson 5-Sep-12 1:36
 Re: Running out of Memory - Maths Check Member 31409626-Sep-12 20:36 Member 3140962 6-Sep-12 20:36
 Re: Running out of Memory - Maths Check Stefan_Lang7-Sep-12 4:29 Stefan_Lang 7-Sep-12 4:29
 Re: Running out of Memory - Maths Check Stefan_Lang7-Sep-12 4:49 Stefan_Lang 7-Sep-12 4:49
 Re: Running out of Memory - Maths Check Stefan_Lang10-Sep-12 0:53 Stefan_Lang 10-Sep-12 0:53
 Re: Running out of Memory - Maths Check Stefan_Lang11-Sep-12 22:46 Stefan_Lang 11-Sep-12 22:46
 Re: Running out of Memory - Maths Check Edward Giles26-Jun-13 19:35 Edward Giles 26-Jun-13 19:35