Sjmarf@sh.itjust.works to Programmer Humor@programming.dev · 2 months agoBrace Stylesh.itjust.worksimagemessage-square156fedilinkarrow-up11.32Karrow-down113
arrow-up11.3Karrow-down1imageBrace Stylesh.itjust.worksSjmarf@sh.itjust.works to Programmer Humor@programming.dev · 2 months agomessage-square156fedilink
minus-squaremagic_lobster_party@kbin.runlinkfedilinkarrow-up15arrow-down1·edit-22 months agoI’m more concerned about that poor stack with all those recursions. It’s also O(n^2) O(n!). I’m not sure what they’re trying to do, but I’m sure it can be done in O(n) (or at least polynomial). Reject.
I’m more concerned about that poor stack with all those recursions.
It’s also
O(n^2)O(n!). I’m not sure what they’re trying to do, but I’m sure it can be done in O(n) (or at least polynomial).Reject.