Problem 17. Find all elements less than 0 or greater than 10 and replace them with NaN

took me probably 20 seconds

THIS PROBLEM IS FANTASTIC!

function y = cleanUp(x)
y = x;
L=length(y);
for i=1:L
if (y(i)<0)|(y(i)>10)
y(i)=NaN;
end
end
end

this hasn't been fixed?

good

l

I reduce my code size with the help in this page.

http://matlabtricks.com/post-16/the-background-of-cody-solutions-having-extremely-low-size.

Besides, leading solution is a cheater.

very easy

Nicely done!

How can I make it shorter?

You could remove the 1's:
i= 1:length(x)
and
x(i)<0 | x(i)>10
Also, it's probably best to use numel instead of length.

First non trivial one, learned a new trick

Any suggestion on how to reduce the size?

x(x < 0 | x > 10) = NaN // use this it will reduce code size

Tried using accumarray on an experimental basis... freaky awesome!!!

Learned from your Solution about accumarray -thanks for sharing it!

excellent,man!

This is called logical indexing

good

No need of colon operator...

So do I. Wonder, I mean.

Thank you for the solution of the extremely low size solution

It's ironic. The size metric is meant to create most elegant solutions. At the same time it's more fun this way.

Straight forward with a for loop. Could definitely be improved considering good code doesn't use loops.

Checkout the built-in function "regexp"

this code works but its score is 51 and thats not good.... so can anyone improve it i'll be grateful.

are you ok?

There can be no elements with <0 AND >10. The problem statement should say <0 OR >10.

I can't understand why is it coming out wrong?? o.O

You would need a loop going through each element of x to finish this... a very bad idea..

hmmm

function y = cleanUp(x)
x=[5 17 -20 99 3.4 2 8 -6]
for i=1:8
if (x(i)<0||x(i)>10)
y(i)=NaN;
else
y(i)=x(i);
end
end

Can anybody tell what is wrong with this code so that it is not clearing test 2.

Check this:Solution 181284.
x is input matrix which will vary rather being defined as in above program.

Ins't there an even easir way of doing this?

Brilliant

impressive!

Does not work because of rounding error

Inefficient code... My solution took 0.022746sec while this one took 0.255477. Although the size was 19...

It is working when I try!?