// output of ./demo/comb/fibgray-rec-demo.cc: // Description: //% Gray code for Fibonacci words, recursive CAT algorithm arg 1: 8 == n [Length of Fibonacci words] default=8 arg 2: 1 == zq [ 0==>Lex order 1==>Gray code] default=1 arg 3: 0 == rq [Whether to reverse order] default=0 1: .1..1..1 2: .1..1... 3: .1..1.1. 4: .1....1. 5: .1...... 6: .1.....1 7: .1...1.1 8: .1...1.. 9: .1.1.1.. 10: .1.1.1.1 11: .1.1...1 12: .1.1.... 13: .1.1..1. 14: ...1..1. 15: ...1.... 16: ...1...1 17: ...1.1.1 18: ...1.1.. 19: .....1.. 20: .....1.1 21: .......1 22: ........ 23: ......1. 24: ....1.1. 25: ....1... 26: ....1..1 27: ..1.1..1 28: ..1.1... 29: ..1.1.1. 30: ..1...1. 31: ..1..... 32: ..1....1 33: ..1..1.1 34: ..1..1.. 35: 1.1..1.. 36: 1.1..1.1 37: 1.1....1 38: 1.1..... 39: 1.1...1. 40: 1.1.1.1. 41: 1.1.1... 42: 1.1.1..1 43: 1...1..1 44: 1...1... 45: 1...1.1. 46: 1.....1. 47: 1....... 48: 1......1 49: 1....1.1 50: 1....1.. 51: 1..1.1.. 52: 1..1.1.1 53: 1..1...1 54: 1..1.... 55: 1..1..1. ct=55 work/object=0.981818