An obituary of Tony Hoare, a pioneer and one of the greatest programmers in the early history of computing.

Posts from this topic will be added to your daily email digest and your homepage feed. If you want to tweak what’s on your feed, you can make a post and ask. If you want to tweak what’s on your feed, ...

A monthly overview of things you need to know as an architect or aspiring architect. Unlock the full InfoQ experience by logging in! Stay updated with your favorite authors and topics, engage with ...

As the world races to build artificial superintelligence, one maverick bioengineer is testing how much unprogrammed intelligence may already be lurking in our simplest algorithms to determine whether ...

The current list of sorting algorithms is great, but it's missing Heap Sort, which is a fundamental comparison-based sorting algorithm. This issue is to implement the logic and visualization for Heap ...

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle the easiest pieces first. But this kind of sorting has a cost.

The original version of this story appeared in Quanta Magazine. Computer scientists often deal with abstract problems that are hard to comprehend, but an exciting new algorithm matters to anyone who ...