Kishu Agarwal

kishuagarwal.github.io

Previous week, we saw how we can use Square root decomposition to solve our problem. This week, we will see how we can solve the same problem by using a different technique called Binary Indexed Tree (also called Fenwick Tree). Binary Indexed tree is a useful technique when we are dealing with a dynamic array of data…

Popular posts: 1
Total points: 241
HN comments: 23
Rank: #10,889 personal

Visit kishuagarwal.github.io → On Hacker News Apr 2019 – Apr 2019

Systems & Performance 1 Software Engineering 1

Most points Most discussed Most cited Newest

Anatomy of an ELF executable

2019241 points23 comments Systems & Performance details

Almost every one of you must have written a program, compiled it and then ran it to see the fruits of your hard labour. It feels good to finally see your program working, isn’t it? But to make all of this work, we have someone else to thankful too. And that is your compiler (of course, assuming that you are working in…