• Eager Eagle@lemmy.world
    link
    fedilink
    English
    arrow-up
    35
    ·
    3 months ago

    at job interview

    “ah sure, I’ll solve it in n log(n) for you with an obscure algorithm because n² is too slow for your 1000 customers, even though there’s no perceived difference for n<10⁷.”