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([13,3,10,7,5,0,2,11,15,1,14,4,6,9,8,12]) -- monosort([13,3,10,7,5,0,2,11,15,1,14,4,6,9,8,12]) divide d_lr -> ([13,3,10,7,5,0,2,11], [15,1,14,4,6,9,8,12]) monosort([13,3,10,7,5,0,2,11]) divide d_lr -> ([13,3,10,7], [5,0,2,11]) monosort([13,3,10,7]) divide d_lr -> ([13,3], [10,7]) monosort([13,3]) divide d_lr -> ([13], [3]) monosort([13]) ⇣ atom; basef -> [13] monosort([3]) ⇣ atom; basef -> [3] post #!mirr -> ([(13, 3)], [(3, 13)]) post !(min, max) -> ([3], [13]) post !nest -> ([3], [13]) combine c_lr -> [3,13] monosort([10,7]) divide d_lr -> ([10], [7]) monosort([10]) ⇣ atom; basef -> [10] monosort([7]) ⇣ atom; basef -> [7] post #!mirr -> ([(10, 7)], [(7, 10)]) post !(min, max) -> ([7], [10]) post !nest -> ([7], [10]) combine c_lr -> [7,10] post #!mirr -> ([(3, 10),(13, 7)], [(7, 13),(10, 3)]) post !(min, max) -> ([3,7], [13,10]) post !nest -> ([3,7], [10,13]) combine c_lr -> [3,7,10,13] monosort([5,0,2,11]) divide d_lr -> ([5,0], [2,11]) monosort([5,0]) divide d_lr -> ([5], [0]) monosort([5]) ⇣ atom; basef -> [5] monosort([0]) ⇣ atom; basef -> [0] post #!mirr -> ([(5, 0)], [(0, 5)]) post !(min, max) -> ([0], [5]) post !nest -> ([0], [5]) combine c_lr -> [0,5] monosort([2,11]) divide d_lr -> ([2], [11]) monosort([2]) ⇣ atom; basef -> [2] monosort([11]) ⇣ atom; basef -> [11] post #!mirr -> ([(2, 11)], [(11, 2)]) post !(min, max) -> ([2], [11]) post !nest -> ([2], [11]) combine c_lr -> [2,11] post #!mirr -> ([(0, 11),(5, 2)], [(2, 5),(11, 0)]) post !(min, max) -> ([0,2], [5,11]) post !nest -> ([0,2], [5,11]) combine c_lr -> [0,2,5,11] post #!mirr -> ([(3, 11),(7, 5),(10, 2),(13, 0)], [(0, 13),(2, 10),(5, 7),(11, 3)]) post !(min, max) -> ([3,5,2,0], [13,10,7,11]) post !nest -> ([0,2,3,5], [7,10,11,13]) combine c_lr -> [0,2,3,5,7,10,11,13] monosort([15,1,14,4,6,9,8,12]) divide d_lr -> ([15,1,14,4], [6,9,8,12]) monosort([15,1,14,4]) divide d_lr -> ([15,1], [14,4]) monosort([15,1]) divide d_lr -> ([15], [1]) monosort([15]) ⇣ atom; basef -> [15] monosort([1]) ⇣ atom; basef -> [1] post #!mirr -> ([(15, 1)], [(1, 15)]) post !(min, max) -> ([1], [15]) post !nest -> ([1], [15]) combine c_lr -> [1,15] monosort([14,4]) divide d_lr -> ([14], [4]) monosort([14]) ⇣ atom; basef -> [14] monosort([4]) ⇣ atom; basef -> [4] post #!mirr -> ([(14, 4)], [(4, 14)]) post !(min, max) -> ([4], [14]) post !nest -> ([4], [14]) combine c_lr -> [4,14] post #!mirr -> ([(1, 14),(15, 4)], [(4, 15),(14, 1)]) post !(min, max) -> ([1,4], [15,14]) post !nest -> ([1,4], [14,15]) combine c_lr -> [1,4,14,15] monosort([6,9,8,12]) divide d_lr -> ([6,9], [8,12]) monosort([6,9]) divide d_lr -> ([6], [9]) monosort([6]) ⇣ atom; basef -> [6] monosort([9]) ⇣ atom; basef -> [9] post #!mirr -> ([(6, 9)], [(9, 6)]) post !(min, max) -> ([6], [9]) post !nest -> ([6], [9]) combine c_lr -> [6,9] monosort([8,12]) divide d_lr -> ([8], [12]) monosort([8]) ⇣ atom; basef -> [8] monosort([12]) ⇣ atom; basef -> [12] post #!mirr -> ([(8, 12)], [(12, 8)]) post !(min, max) -> ([8], [12]) post !nest -> ([8], [12]) combine c_lr -> [8,12] post #!mirr -> ([(6, 12),(9, 8)], [(8, 9),(12, 6)]) post !(min, max) -> ([6,8], [9,12]) post !nest -> ([6,8], [9,12]) combine c_lr -> [6,8,9,12] post #!mirr -> ([(1, 12),(4, 9),(14, 8),(15, 6)], [(6, 15),(8, 14),(9, 4),(12, 1)]) post !(min, max) -> ([1,4,8,6], [15,14,9,12]) post !nest -> ([1,4,6,8], [9,12,14,15]) combine c_lr -> [1,4,6,8,9,12,14,15] post #!mirr -> ([(0, 15),(2, 14),(3, 12),(5, 9),(7, 8),(10, 6),(11, 4),(13, 1)], [(1, 13),(4, 11),(6, 10),(8, 7),(9, 5),(12, 3),(14, 2),(15, 0)]) post !(min, max) -> ([0,2,3,5,7,6,4,1], [13,11,10,8,9,12,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