# cost = 9 # n_nodes = 45 # version = 1.0 # time = 0.090 # n=10, i=1, cost=9: no comparisons done find_1(a,b,c,d,e,f,g,h,i,j) = if a > b then find_2(a,c,d,e,f,g,h,i,j) else find_2(b,c,d,e,f,g,h,i,j) # n=9, i=1, cost=8: no comparisons done find_2(a,b,c,d,e,f,g,h,i) = if a > b then find_3(a,c,d,e,f,g,h,i) else find_3(b,c,d,e,f,g,h,i) # n=8, i=1, cost=7: no comparisons done find_3(a,b,c,d,e,f,g,h) = if a > b then find_4(a,c,d,e,f,g,h) else find_4(b,c,d,e,f,g,h) # n=7, i=1, cost=6: no comparisons done find_4(a,b,c,d,e,f,g) = if a > b then find_5(a,c,d,e,f,g) else find_5(b,c,d,e,f,g) # n=6, i=1, cost=5: no comparisons done find_5(a,b,c,d,e,f) = if a > b then find_6(a,c,d,e,f) else find_6(b,c,d,e,f) # n=5, i=1, cost=4: no comparisons done find_6(a,b,c,d,e) = if a > b then find_7(a,c,d,e) else find_7(b,c,d,e) # n=4, i=1, cost=3: no comparisons done find_7(a,b,c,d) = if a > b then find_8(a,c,d) else find_8(b,c,d) # n=3, i=1, cost=2: no comparisons done find_8(a,b,c) = if a > b then find_9(a,c) else find_9(b,c) # n=2, i=1, cost=1: no comparisons done find_9(a,b) = if a > b then a else b