topic LabVIEW Digest Challenge 1 in LabVIEW Digest Programming Challenges

LabVIEW Digest Challenge 1

CharlotteN — Fri, 10 Mar 2017 10:54:48 GMT

Hi Everyone and welcome to the first LabVIEW Digest challenge!

We'll start with some simple addition. Email your entries to LabVIEWDigestCompetition@ni.com

The Challenge:

Return the sum of the numbers in an array.

Return 0 if the array is empty.

To make things more difficult - the number 10 is worth double. So in the example below we have 1 + 10 x 2 + 2 + 6 = 29

I've attached a starting VI for you to use (saved for LabVIEW 2010 and upwards).

Close date: Monday 10th April

Please note the competition is only open to LabVIEW users in Europe, Middle East, India and Africa.

Competition Rules

Happy coding!

Charlotte

Re: LabVIEW Digest Challenge 1

IanLuck — Thu, 23 Mar 2017 11:43:03 GMT

Attached is a proposed solution (in LabVIEW 2015)

Regards, Ian

Re: LabVIEW Digest Challenge 1

AHJen — Thu, 23 Mar 2017 11:51:47 GMT

Well, let's give it a shot!

I can't claim to have much experience using LabVIEW just yet, but here's my solution.

Re: LabVIEW Digest Challenge 1

Ceknaz — Thu, 23 Mar 2017 14:50:27 GMT

Hello Everyone,

I'd like to share my solution for this Challenge. (LV2015 formatted)

Best Regards,
Y.Ceknaz

Re: LabVIEW Digest Challenge 1

StefanG — Thu, 23 Mar 2017 15:12:51 GMT

Here is a solution, that does not use loops.

/SG

Re: LabVIEW Digest Challenge 1

Matti_Zimmer — Thu, 23 Mar 2017 15:39:22 GMT

Another Solution in LV2015

Re: LabVIEW Digest Challenge 1

CharlotteN — Thu, 23 Mar 2017 16:13:02 GMT

Hi Everyone,

Thanks for all the submissions, we've had a huge range of different ways to solve this problem and I'm very happy to see the enthusiastic responses!

Can I please ask everyone that has posted on the forums to submit their answers to our email address: LabVIEWDigestCompetition@ni.com. I will be selecting the winner from that email address.

Once the competition closes I'll post some of the different ways people solved the problem (anonymously) so people can learn from them.

Thanks,

Charlotte

Rif.: LabVIEW Digest Challenge 1

linuxyz — Thu, 23 Mar 2017 17:51:10 GMT

This is my solution.

Best regards.

L.D.G.

Re: LabVIEW Digest Challenge 1

BrotherTom — Fri, 24 Mar 2017 06:51:41 GMT

Another one.

Greetings

Re: LabVIEW Digest Challenge 1

PhilB58 — Fri, 24 Mar 2017 12:08:22 GMT

code sent 🙂

Re: LabVIEW Digest Challenge 1

hkd2015 — Tue, 04 Apr 2017 12:20:42 GMT

I've sent my entry. Looking forward to results .

Re: LabVIEW Digest Challenge 1

CharlotteN — Tue, 04 Apr 2017 12:31:50 GMT

Thanks! I have just received it

We've received a huge range of different solutions so I look forward to sharing them with everyone next week.

Charlotte

Re: LabVIEW Digest Challenge 1

CharlotteN — Thu, 13 Apr 2017 07:14:35 GMT

Hi Everyone,

I picked a correct solution at random we now have a winner I've attached the winning code entry below and there's a free training voucher on its way to the programmer now! Congratulations!

A lot of people had a solution like this so I recommend checking out this link on auto-indexing for loops as that makes life a lot easier and stops the while loop within a while loop which can be easy to get stuck in!

Thank you to everyone who entered the competition! We will be running it again in the next few months so keep an eye out for the LabVIEW Digest. We had a lot of entries and despite a relatively simple problem, we had a huge number of different ways of solving it! I've posted below some of the other variations as there's always things to learn from other people's code.

Re: LabVIEW Digest Challenge 1

CharlotteN — Thu, 13 Apr 2017 13:37:24 GMT

Search and replace array elements first, then sum - not quite right, will only find the first 10 value, not the second. Issue fixed below.

A beautifully simple solution:

Using auto indexing and for loops:

We even had an object-oriented solution from Thoric which I have attached:

Which solution do you like best?

Re: LabVIEW Digest Challenge 1

James_McN — Thu, 13 Apr 2017 09:25:29 GMT

I don't want to be that guy, but I will be! There is a small bug in solution 1 - try putting in two '10's, it will pick the first but not the latter. It's an issue I've put in code before with the 1D search. It just needs a little more code to work fully though - the concept is good.

I like the simple solution - I had a similar concept in mind. It feels more efficient than looping but I'm not sure if it is!

Re: LabVIEW Digest Challenge 1

CharlotteN — Thu, 13 Apr 2017 13:39:21 GMT

Oh good spot! That will teach me to only thoroughly check the winner. I thought I had checked them all but obviously not. I made a quick alternative solution based on that code to fix that bug. It's a bit more convoluted now though, perhaps there's a simpler way but still using the same idea of searching and replacing.

Re: LabVIEW Digest Challenge 1

Thoric — Thu, 11 May 2017 15:32:08 GMT

@CharlotteN wrote:

We even had an object-oriented solution from Thoric which I have attached:

The OO approach is extensible. The parent class for storing numbers can be overridden with any child class for exhibiting special behaviour when adding numbers. Also, the method for "sum" can be extended with new methods, such as "product" or "factorial" etc., without much effort.

For this problem it's clearly way over the top, but perhaps good reading for anyone interested in learning about OOP in LabVIEW.

I've enjoyed the challenge Charlotte, looking forward to the next one!

Re: LabVIEW Digest Challenge 1

sankar06 — Tue, 16 May 2017 12:55:32 GMT

Can you please announce the winner of Challenge 1, and then post next challenge?

Re: LabVIEW Digest Challenge 1

CharlotteN — Tue, 16 May 2017 13:01:28 GMT

Hi Sankar06,

The winner was announced a few weeks ago and the winning solution can be seen above.

We will be running the challenge roughly every 3 months when we release the LabVIEW Digest Newsletter. If you're interested in hearing about the next challenge immediately I recommend looking at your email settings and selecting to receive the LabVIEW Digest. If not, keep checking back here for Challenge 2. You can expect it around late May, early June.

Thanks,

Charlotte

Re: LabVIEW Digest Challenge 1

ju4n27 — Mon, 18 Feb 2019 22:55:31 GMT

This my solution: