The Nineteenth Byte

« first day (5139 days earlier) ← previous day last day (1 day later) »

Seggan

00:18

@TheEmptyStringPhotographer you havent proven P != NP tho, thats just a counterexample to P=NP

Unrelated String

(and also the threat to modern cryptography is very much a known aspect of "we haven't proven P!=NP but we just. really really want to assume it because like no way is it not true", granted there's also overlap with post-quantum cryptography and whatnot)

Seggan

00:31

"like no way is it not true"? more like "i really really hope its not true otherwise the past 30 years will have to be undone"

at the same times theres also advantages if P=NP

9 hours later…

New Posts

09:53

Q: Tips for golfing in Bespoke

What are some general tips you have for golfing in Bespoke? I want answers that are specific to Bespoke (e.g. don't just say "remove comments"). One tip per answer. Esolangs page Documentation Official interpreter

New Posts

10:23

Q: Tips for golfing in COBOL

COBOL is a high-level, compiled programming language designed for business applications, readability, and long-term maintainability. It emphasizes verbose syntax, English-like readability, and robust support for data processing, file handling, and business logic. COBOL's structure is divided into...

code-golf tips cobol

mousetail

It's the tipocolypse

Neil

@NewPosts given it emphasises verbose syntax, my tip is not to golf in COBOL

The Empty String Photographer

A sorting algorithm that will decimate your RAM:

def ram_killer_sort(l):
    """
    A sorting function that sorts in O(size_of_list + highest_number_in_list) and only works with natural numbers.
    This sort sacrifices your space complexity however, which is O(highest_number_in_list).
    """
    assert all(map(lambda x:x%1==0and x>=0, l)) # O(n)
    r = [""] * (max(l) + 1) # O(n + m) where m is highest item in list
    for item in l:
        r[item] += f"{item}\n" # O(n)
    return [*map(int, "".join(r).split("\n")[:-1])] # O(n + m) where m is highest item in list

l4m2

11:16

@DannyuNDos Dupe of sandbox (codegolf.meta.stackexchange.com/a/22251/76323) but maybe not main

New Posts

11:29

Q: Tips for golfing in Fortran

Fortran is a compiled imperative language known for its numerical and scientific computing strengths. It blends traditional procedural programming with some modern features like array operations. What general tips do you have for golfing in Fortran? I'm looking for approaches and tricks that are ...

code-golf tips

2 hours later…

Ginger

13:21

→ 1 GANYMEDE moved to The Nineteenth Bakery

lyxal

more like ganyYEET

New Posts

Q: Tips for golfing in Sidef

Sidef, created by Daniel Șuteu, is designed for expressive, compact code, especially in mathematical domains (e.g., number theory, combinatorics). I’m diving into code golf challenges using Sidef and want to minimize my character count. What are some expert tips for writing shorter Sidef code? I’...

code-golf tips

2 hours later…

The Empty String Photographer

16:01

def ticksort(l):
    ll = l.copy()
    r = []
    c = 0
    while True:
        c += 1
        e = 0
        for i in range(len(ll)):
            ll[i-e] -= 1
            if ll[i-e] <= 0:
                r.append(ll[i-e] + c)
                ll.remove(ll[i-e])
                e += 1
        if ll == []:
            break
    return r

TEST_CASE = [7, 11, 5, 2, 3, 0]
print(ticksort(TEST_CASE))

l4m2

16:40

Languages on esolang that base on another lang and shift ascii by some value, list?

3 hours later…