How I write and improve algorithms

Today, I talk algorithm design by explaining how I would write an algorithm to check if n sets are disjoint (A ∩ B = ∅). This is not a particularly difficult algorithm, but it is a good example of how to improve over a naive brute force algorithms. Our final solution runs in O(N) time, which meets the omega limit.

Mentioned archived /g/ thread: https://desuarchive.org/g/thread/87829758/

(Apologies for the sniffing, btw, I somehow managed to get a cold in summer).

Site: ethanjmarshall.co.uk GitHub: github.com/ethanv2 Twitter: /dev/null ... https://www.youtube.com/watch?v=be8De747dU8