How to Solve a Problem in an Array Language With Heat Performance

I love the array language paradigm. But definitely there are category of problems and like certain algorithms that you hit walls in array languages. So like, maybe there is actually a very nice way to solve that with heat performance. Well, yeah. I will say, I don't know about the second smallest values. But when I looked at windowed reduce in dialogue, so finding the smallest, the very smallest value from every window of say 10 elements or 100 elements or something. When I looked at this, Roger, we had written the C style Q based algorithm to do this. The C style Q. He wrote the solution in Q, but like Q, U, E, U,E

Transcript

Play full episode

Remember Everything You Learn from Podcasts

Save insights instantly, chat with episodes, and build lasting knowledge - all powered by AI.