News for hackers. Stuff that matters.
Re:Unconventional Sorting Algorithms by lifthrasiir on Friday October 22, 2021 @01:00AM (#28953882)

    import ctypes
    
    def mutation_sort(a):
        for i, v in enumerate(a):
            ctypes.c_int.from_address(id(v) + 24).value = i # for x86-64, adjust the offset for your platform
        return a
    
    def is_sorted(a):
        prev = None
        for v in a:
            if prev is not None and prev > v: return False
            prev = v
        return True
    
    is_sorted(mutation_sort([3000, 1000, 7000, 8000, 2000])) # prints True

There are no comments on this comment yet.