-
Strassen algorithm for matrix miltiplication
Strassen algorithm is an algorithm used for matrix multiplication. It is faster than the standard matrix multiplication algorithm, but would be slower than the fastest known algorithm for extremely large matrices.
It's useful mostly for large matrices.
-
Visual Cryptography
Simple implementation of the visual cryptography scheme based on Moni Naor and Adi Shamir, Visual Cryptography, EUROCRYPT 1994, pp1–12. This technique allows visual information like pictures to be encrypted so that decryption can be done visually.
The code outputs two files. Try printing them on two separate transparencies and putting them one on top of the other to see the hidden message.
-
Canny edge detection
Looking for a fast and open implementation of the Canny Edge Detector algorithm.
-
RLE - Run Length Encoding (Matlab)
A Matlab implementation of RLE (Run Length Encoding) demonstration that takes a string and compresses it.
Works well when long sequences of the same letter appear in the string.
-
LBP - Local Binary Patterns texture operator
Implementation of Local Binary Pattern (LBP), a simple but very efficient texture operator which labels the pixels of an image by thresholding the neighborhood of each pixel with the value of the center pixel. It considers the result as a binary number.
LBP texture operator has become a popular approach in various applications. It can be seen as a unifying approach to the traditionally divergent statistical and structural models of texture analysis.
LBP operator is robust to monotonic gray scale changes caused by illumination variations, etc.
-
Collatz conjecture (Ulam conjecture, Kakutani's problem, wondrous numbers)
The graph of the unsolved Collatz conjecture.
The conjecture is also known as the 3n + 1 conjecture, the Ulam conjecture (after Stanisław Ulam), Kakutani's problem (after Shizuo Kakutani), Thwaites conjecture (after Sir Bryan Thwaites), Hasse's algorithm (after Helmut Hasse) or the Syracuse problem;
The sequence of numbers involved is referred to as the hailstone sequence or hailstone numbers, or as wondrous numbers.
-
Merge Sort O(n log n)
Merge sort is an O(n log n) comparison-based sort algorithm. In most implementations it is stable, meaning that it preserves the input order of equal elements in the sorted output. The algorithm uses the a divide and conquer algorithmic paradigm.
Invented by John von Neumann in 1945.
-
Conway's game of life
Simple Matlab implementation of Conway's game of life.
-
Mandelbrot Fractal in Matlab
Mandelbrot fractal calculated in simple Matlab code. Feel free to make the code better.
-
IBP Super Resolution
IBP (Iterative Back Projection) Super Resolution example Matlab code for demonstrations. Good as a first example.
About Us
Algorito is a site for sharing algorithm implementations written in various programming languages such as Matlab, C++, Java, Python, etc.
Download algorithms on various topics, upload your own implementations and post requests for the algorithms you need.
Enjoy!