%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% PART 2: EVALUATION CRITERIA
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
[Penalties are cumulative]

%%%%%%%%%%%%%%%% EX.1:
-10% if not "as efficient as possible" (does not stop when the first [last] solution is found).
-20% if returns the last solution rather the first one as required, or vice versa
-10% for each minor error
-10% if you returned the java index (e.g. "0" for the first element) rather than the "user perspective" (e.g. "1" for the first element)
-100% for wrong solution

%%%%%%%%%%%%%%%% EX.2:

-100% if you did not answer correctly question 1 (and hence to q.2)
-75% if answered correctly to question 1 but not to question 2

%%%%%%%%%%%%%%%% EX.3:
-100% for major algorithmical errors
-20% if does not consider the case when one of the two arrays reaches the end
-20% minor algorithmical error

%%%%%%%%%%%%%%%% EX.4:

-10% if forgot to consider arcs to already-visited nodes
-10% if ideas ok, but 1 mistake
-20% if ideas ok, but few mistakes
-100% if wrong ideas or repeated mistakes

%%%%%%%%%%%%%%%% EX.5:

-10% for small mistakes
-20% for tree not in Dijkstra's order
-30% for more than one mistake