Algorithms

c++:

• isprime

Uses Sieve of Eratosthenes to preprocess prime numbers. Takes a number as input and outputs whether it's a prime.

• union find

• KMP Search

Implementation of KMP (Knuth Morris Pratt) Pattern Searching

SML

• colatz conjucture

Start with a number n > 1. Find the number of steps it takes to reach one using the following process:
o Divide it by 2, if n is even.
o Multiply it by 3 and add 1, if n is odd.