René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"Questions regarding the binary search example","articleBody":"Hi \r\n\r\nThanks for the book. Its very interesting.\r\n\r\nI have one question regarding the binary search example that you have. The way you optimize further (after making it branchless and using prefetching) is to reorder it in an entzynger array. But since this is an O(n) operation anyway on the array, what is the point? We can as well search for the element while constructing the heap structure right? I dont see the need to do this and then do a binary search (albeit efficient) after that.\r\n\r\nSo to me it looks like you have introduced an additional O(n) operation to make the O(log n) operation faster, which doesnt make sense to me.","author":{"url":"https://github.com/rohanrayan","@type":"Person","name":"rohanrayan"},"datePublished":"2024-06-05T05:19:50.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":0},"url":"https://github.com/291/algorithmica/issues/291"}