-
-
merge sort
merge sort
-
MergeSort
Just my version of mergesort ....
-
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.
-
Binary Tree
Binary tree in C++
Simple, may not be the best implementation there is. Contains functions for inserting, deleting, finding the next and previous values, checking if a node is a leaf, printing, searching, counting the number of nodes, etc.
Also contains a main with examples. Nice for beginners.
-
binary search tree in C
implementation and some basic functions as: find next/previous, serch, add, delete etc.
you are more then welcome to send notes and corrections.
-
Doubly linked list algorithm in C++
Doubly linked list in C++. A simple implementation that includes a few simple features:
Adding a node, erasing a node, searching a node, counting the number of nodes in the list, printing the list by a recursive function, printing the list iteratively and printing the list in reverse order.
The nodes hold only integers as data but this can be generalized easily.
-
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.
-
Prim's algorithm in Java
Prim's algorithm is used to find a minimum spanning tree. It is very similar to Kruskal's algorithm of finding shortest path in a graph. Prim's algorithm starts from a vertex and then keeps following the minimum distant edges to discover vertices, given that the vertex was not discovered before. Current implementation uses a simple and straight implementation in java. It can be further improved by improving sorting algorithm and using Min-Heap data structure for vertices. Those are not implemented to keep it simple enough to understand for all.
-
Kruskal's algorithm in Java
Kruskal's algorithm is well known for finding MST or minimum spanning tree. First it sorts all the edges in non-decreasing order. Then, it keeps taking edges from the sorted list given that, at least one of the vertices at two ends of the edge is not discovered before. Current implementation uses java and pretty straight forward approach. It can be further improved by imporving sorting algorithm and using a custom Set data structure for set operations.
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!