BlogHide Resteemsivlad (25)in programming • 7 years agoThe Sieve of Eratosthenes Part 1: efficiently generating primes up to nThe Sieve of Eratosthenes is an algorithm for finding prime numbers in a range. Conceptually, it's a very simple algorithm. Let's assume our range is always [2, n]. In our examples, we'll consider…ivlad (25)in algorithms • 7 years agoHow to find a second best Minimum Spanning TreeA Minimum Spanning Tree (MST) of a weighted graph G(V, E) is a tree obtained by removing some edges in G such that the sum of the weights of the resulting tree's edges is as small as possible. In…
