Sjmarf@sh.itjust.works to Programmer Humor@programming.dev · 2 years agoBrace Stylesh.itjust.worksexternal-linkmessage-square153linkfedilinkarrow-up11.32Karrow-down114
arrow-up11.31Karrow-down1external-linkBrace Stylesh.itjust.worksSjmarf@sh.itjust.works to Programmer Humor@programming.dev · 2 years agomessage-square153linkfedilink
minus-squaremagic_lobster_party@kbin.runlinkfedilinkarrow-up15arrow-down1·edit-22 years 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.