The Race Solution to Complexity in Array Languages

Using a heap backed priority queue in that way, not only do you get the ability to update it as you roll it along, but also it allows you to get the nth order statistic. The naive approach in an array language is you slice the whole structure into the windows, and then for every one of those slices, you want to filter it, sort it and, and extract the nth element from it with with a cap appropriately based on how your language handles out decks or what have you. But now I guess now is the so that my sort of goal of bringing it up last episode is like, is there a race solution to this that doesn't fall into that naive category where

Transcript

Play full episode

Transcript

Episode notes

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!

Get the app