hazlin on Nostr: I am once again amazed by just how fast recursive functions in CL are. Last I ...
I am once again amazed by just how fast recursive functions in CL are. Last I measured it, a recursive traversal in CL is only 3x slower than a C iteration over the same number of elements. And, is so much more flexible.
The only why CL didn't take over, really is because it was suppressed at the education level.
Published at
2023-05-12 15:51:56Event JSON
{
"id": "c3c645563931784060294413163f325d55659caa52e2499e659334b724370085",
"pubkey": "9e8a3ee2cfda5a10c16c1f23084d1073062010510083f02ef5553430090f0a63",
"created_at": 1683906716,
"kind": 1,
"tags": [
[
"mostr",
"https://poa.st/objects/f9b19fdc-3080-42bc-8721-17804eeea9c4"
]
],
"content": "I am once again amazed by just how fast recursive functions in CL are. Last I measured it, a recursive traversal in CL is only 3x slower than a C iteration over the same number of elements. And, is so much more flexible.\n\nThe only why CL didn't take over, really is because it was suppressed at the education level.",
"sig": "86a9307be514d66ceba03c94dc5ad400eaae09c777b034ae64d5a5a39e1b3f6d3b86378385bbbc16856028d32ac780452f5c6e01cecae906327f0d9b4c488c73"
}