Null-hypothesis techniques

Question

Hi, trying to do my best with above i've got an idea for the first special quiz.

I propone to give a special quests to make some method possibly light in op time sense.

Structure of a quiz:

1. Problem - make Your best algorithm.
2. Experience - You get i.e. 20xp for first.
3 Loosings - if someone will build lighter code, (s)he gets 21XP but You loose 19XP.
4. Badges - i.e. One-Man-Army for 3 good codes.

I think it's a very powerfull contribution for a developers society and end-users also.

Answer 1

In my example i present a really short quest:
make any-lenght-array a cycleable:
have a scissors-paper-rock game respectively A B C args or 1,2,3 or some enums.
How wil You do it in max 3 lines (";" means line)
counted inside the method
for readability :
method(args){
meant line;
meant line;
+ return/void;
}
for above s-p-r game i just use:
int arg=1,length=77;
return ((arg+1)%(length));

so for 77 i get 0, for 0 i get 1 and so on.
whotch takes 2 lines including a declarations