x = 1; y_correct = 2; assert(isequal(binary_neighbour(x),y_correct))

x = 2; y_correct = 1; assert(isequal(binary_neighbour(x),y_correct))

x = 5; y_correct = 6; assert(isequal(binary_neighbour(x),y_correct))

x = 3; y_correct = 5; assert(isequal(binary_neighbour(x),y_correct))

x = 4; y_correct = 2; assert(isequal(binary_neighbour(x),y_correct))

x = 16; y_correct = 8; assert(isequal(binary_neighbour(x),y_correct))

x = 17; y_correct = 18; assert(isequal(binary_neighbour(x),y_correct))

x = 11; y_correct = 13; assert(isequal(binary_neighbour(x),y_correct))

x = 15; y_correct = 23; assert(isequal(binary_neighbour(x),y_correct))

x = 92; y_correct = 90; assert(isequal(binary_neighbour(x),y_correct))

% DISABLED % ________'FAIR'_SCORING_SYSTEM______________ % % This section scores for usage of ans % and strings, which are common methods % to reduce cody size of solution. % Here, strings are threated like vectors. % Please do not hack it, as this problem % is not mentioned to be a hacking problem. % try % size_old = feval(@evalin,'caller','score'); % all_nodes = mtree('binary_neighbour_disabled.m','-file'); str_nodes = mtfind(all_nodes,'Kind','STRING'); eq_nodes = mtfind(all_nodes,'Kind','EQUALS'); print_nodes = mtfind(all_nodes,'Kind','PRINT'); expr_nodes = mtfind(all_nodes,'Kind','EXPR'); % size = count(all_nodes) ... +sum(str_nodes.nodesize-1) ... +2*(count(expr_nodes) ... +count(print_nodes) ... -count(eq_nodes)); % feval(@assignin,'caller','score',size); % fprintf('Size in standard cody scoring is %i.\n',size_old); fprintf('Here it is %i.\n',size); end % %_________RESULT_____________________________