QueensN all the solutions to place N queens on a N x N board FibN Nth fibonacci number (naive algorithm) RingsN list of numbers among 1 and N with rings(M) = M MergesortN sort a list of N elements using mergesort Query all the solutions for a database consult reverse Naive reverse of a list
EXAMPLE SICSTUS Babel RATIO Queens7 620 1015 1:1.64 Queens8 2689 4569 1:1.70 Queens9 12540 24480 1:1.95 Fib10 17 20 1:1.18 Fib20 980 3410 1:3.48 Rings50 919 80 11.49:1 Rings200 3789 680 5.57:1 Rings1000 19680 10236 1.92:1 Mergesort100 120 570 1:4.75 Mergesort500 510 3068 1:6.02 Query 58 148 1:2.55
EXAMPLE functional relational inverted funct. inverted rel. problem size fun val = ? rel (val, ?) fun ? = val rel (?, val) reverse 20 24.4 49.1 176.6 304.6 reverse 40 91.7 212.1 1291.0 2322.1 Queens 6 154.8 277.8 204.0 371.7 Queens 8 988.7 1829.0 1237.7 2319.7 Queens 10 1285.0 2426.9 2942.9 5775.3
EXAMPLE size Eager Naive Lazy Demandedness Analysis
sublists 10 0.47 1.00 0.62
11 0.91 1.98 1.24
12 1.86 3.96 2.42
13 3.68 7.94 4.80
14 7.42 15.82 9.60
15 15.05 31.75 19.23
naive 4 1.06 0.89 0.21
n queens 5 14.50 10.55 2.60
6 247.03 174.30 39.30
Go to index