Sliding window algorithm on steroids! This modifies the existing sliding window algorithm for a particular use-case to provide better results without complex deep-learning algorithms.
Learn how to quickly perform color transfer from one input image (source) onto another input image (destination) by utilizing the Lab* color space and the mean and standard deviation of each L*, a*, and b* channels.
Learn how you can perform an in-place "uniform" shuffle of a list such that each element in the original list has the same probability of ending up in each spot in the final list.
Fibonacci numbers are the numbers in the following integer sequence, called the Fibonacci sequence, and characterized by the fact that every number after the first two is the sum of the two preceding ones. But there's an unintuitive way to calculate them and it's very fast!
The use of random permutations is often fundamental to fields that use randomized algorithms such as coding theory, cryptography, and simulation. A good example of a random permutation is the shuffling of a deck of cards: this is ideally a random permutation of the 52 cards.
The Euclidean algorithm helps us find the greatest common divisor (GCD) of two or more numbers.