Mou Code

Divacon Trace Output


monosort

-- source -- randarr = shuffled(4) nest = PDC(d_lr,c_lr, !(min,max) @ #!corr, id, atom, id) monosort = PDC(d_lr,c_lr, id, !nest @ !(min,max) @ #!mirr, atom, id) trace(monosort, randarr) -- end source -- -- lib: monosort_lib.py -- """Helpers for monosort.dc. Loaded via: ./pydc dcsrc/monosort.dc dcsrc/monosort_lib.py `randints(N)` returns 2^N random integers in [0, 99] — small enough that the trace stays readable, big enough that collisions are rare for small N. `shuffled(N)` returns a uniform permutation of [0..2^N - 1] — useful for verifying the sort end-to-end (output should be [0, 1, ..., 2^N - 1]).""" import random def randints(N, lo=0, hi=99, seed=None): """List of 2**N random integers in [lo, hi].""" if seed is not None: random.seed(seed) return [random.randint(lo, hi) for _ in range(2 ** N)] def shuffled(N, seed=None): """A random permutation of [0..2**N - 1].""" if seed is not None: random.seed(seed) arr = list(range(2 ** N)) random.shuffle(arr) return arr -- end lib -- -- trace: monosort([10,6,7,8,9,13,1,12,15,3,2,0,5,14,4,11]) -- monosort([10,6,7,8,9,13,1,12,15,3,2,0,5,14,4,11]) divide d_lr -> ([10,6,7,8,9,13,1,12], [15,3,2,0,5,14,4,11]) monosort([10,6,7,8,9,13,1,12]) divide d_lr -> ([10,6,7,8], [9,13,1,12]) monosort([10,6,7,8]) divide d_lr -> ([10,6], [7,8]) monosort([10,6]) divide d_lr -> ([10], [6]) monosort([10]) ⇣ atom; basef -> [10] monosort([6]) ⇣ atom; basef -> [6] post #!mirr -> ([(10, 6)], [(6, 10)]) post !(min, max) -> ([6], [10]) post !nest -> ([6], [10]) combine c_lr -> [6,10] monosort([7,8]) divide d_lr -> ([7], [8]) monosort([7]) ⇣ atom; basef -> [7] monosort([8]) ⇣ atom; basef -> [8] post #!mirr -> ([(7, 8)], [(8, 7)]) post !(min, max) -> ([7], [8]) post !nest -> ([7], [8]) combine c_lr -> [7,8] post #!mirr -> ([(6, 8),(10, 7)], [(7, 10),(8, 6)]) post !(min, max) -> ([6,7], [10,8]) post !nest -> ([6,7], [8,10]) combine c_lr -> [6,7,8,10] monosort([9,13,1,12]) divide d_lr -> ([9,13], [1,12]) monosort([9,13]) divide d_lr -> ([9], [13]) monosort([9]) ⇣ atom; basef -> [9] monosort([13]) ⇣ atom; basef -> [13] post #!mirr -> ([(9, 13)], [(13, 9)]) post !(min, max) -> ([9], [13]) post !nest -> ([9], [13]) combine c_lr -> [9,13] monosort([1,12]) divide d_lr -> ([1], [12]) monosort([1]) ⇣ atom; basef -> [1] monosort([12]) ⇣ atom; basef -> [12] post #!mirr -> ([(1, 12)], [(12, 1)]) post !(min, max) -> ([1], [12]) post !nest -> ([1], [12]) combine c_lr -> [1,12] post #!mirr -> ([(9, 12),(13, 1)], [(1, 13),(12, 9)]) post !(min, max) -> ([9,1], [13,12]) post !nest -> ([1,9], [12,13]) combine c_lr -> [1,9,12,13] post #!mirr -> ([(6, 13),(7, 12),(8, 9),(10, 1)], [(1, 10),(9, 8),(12, 7),(13, 6)]) post !(min, max) -> ([6,7,8,1], [10,9,12,13]) post !nest -> ([1,6,7,8], [9,10,12,13]) combine c_lr -> [1,6,7,8,9,10,12,13] monosort([15,3,2,0,5,14,4,11]) divide d_lr -> ([15,3,2,0], [5,14,4,11]) monosort([15,3,2,0]) divide d_lr -> ([15,3], [2,0]) monosort([15,3]) divide d_lr -> ([15], [3]) monosort([15]) ⇣ atom; basef -> [15] monosort([3]) ⇣ atom; basef -> [3] post #!mirr -> ([(15, 3)], [(3, 15)]) post !(min, max) -> ([3], [15]) post !nest -> ([3], [15]) combine c_lr -> [3,15] monosort([2,0]) divide d_lr -> ([2], [0]) monosort([2]) ⇣ atom; basef -> [2] monosort([0]) ⇣ atom; basef -> [0] post #!mirr -> ([(2, 0)], [(0, 2)]) post !(min, max) -> ([0], [2]) post !nest -> ([0], [2]) combine c_lr -> [0,2] post #!mirr -> ([(3, 2),(15, 0)], [(0, 15),(2, 3)]) post !(min, max) -> ([2,0], [15,3]) post !nest -> ([0,2], [3,15]) combine c_lr -> [0,2,3,15] monosort([5,14,4,11]) divide d_lr -> ([5,14], [4,11]) monosort([5,14]) divide d_lr -> ([5], [14]) monosort([5]) ⇣ atom; basef -> [5] monosort([14]) ⇣ atom; basef -> [14] post #!mirr -> ([(5, 14)], [(14, 5)]) post !(min, max) -> ([5], [14]) post !nest -> ([5], [14]) combine c_lr -> [5,14] monosort([4,11]) divide d_lr -> ([4], [11]) monosort([4]) ⇣ atom; basef -> [4] monosort([11]) ⇣ atom; basef -> [11] post #!mirr -> ([(4, 11)], [(11, 4)]) post !(min, max) -> ([4], [11]) post !nest -> ([4], [11]) combine c_lr -> [4,11] post #!mirr -> ([(5, 11),(14, 4)], [(4, 14),(11, 5)]) post !(min, max) -> ([5,4], [14,11]) post !nest -> ([4,5], [11,14]) combine c_lr -> [4,5,11,14] post #!mirr -> ([(0, 14),(2, 11),(3, 5),(15, 4)], [(4, 15),(5, 3),(11, 2),(14, 0)]) post !(min, max) -> ([0,2,3,4], [15,5,11,14]) post !nest -> ([0,2,3,4], [5,11,14,15]) combine c_lr -> [0,2,3,4,5,11,14,15] post #!mirr -> ([(1, 15),(6, 14),(7, 11),(8, 5),(9, 4),(10, 3),(12, 2),(13, 0)], [(0, 13),(2, 12),(3, 10),(4, 9),(5, 8),(11, 7),(14, 6),(15, 1)]) post !(min, max) -> ([1,6,7,5,4,3,2,0], [13,12,10,9,8,11,14,15]) post !nest -> ([0,1,2,3,4,5,6,7], [8,9,10,11,12,13,14,15]) combine c_lr -> [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15] -- result: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15] --
Your thoughts?
(will not be shared or abused)
Comment:
                                        Feedback is welcome.
Copyright © 2025 Thomas C. Veatch. All rights reserved.
Created: May 2026