Algorithm Design

QuickSort is one of my favourite algorithms proposed by Tony Hoare in 1959. The elegance of this algorithm is shrouded by the gory details of cache-aware partitioning schemes and complexity analysis when introduced in academia. The background image depicts my opinion on how QuickSort should be taught to a beginner.

Download

Photo credit: Carbon

On computing next greater intervals in linear time

9 minute read

Notes on how monotonic stacks are used to solve the problem of computing next greater intervals in linear time.

Algorithm Design

Behlool Sabir

On computing next greater intervals in linear time