This algorithm is used to find the shortest path between all pairs of vertices, including negative edges. // Floyd-Warshall Shortest...

Using a grid of cells that hold values, try to find the maximum number of points that can be summed by using two traversals. The first...

The Fibonacci series is a sequence of numbers where one item is the sum of the previous two numbers. The first 2 numbers are 0 and 1, so...

The box stacking problem is a variation of the Longest Increasing Subsequence problem. The statement is that we are given n types of...

A spanning tree is a subgraph of an existing graph that is a tree and connects all the nodes. There can be many spanning trees in a...

A spanning tree is a subgraph of an existing graph that is a tree and connects all the nodes. There can be many spanning trees in a...

An algorithm to find the minimum number of coins / banknotes for a specific value. // Number of coins #include <bits/stdc++.h> using...

Using this algorithm, we find the shortest path from a node to all the other nodes in a weighted directed graph. It works with negative...

Huffman’s Coding algorithms is used for compression of data so that it doesn’t lose any information. Each symbol is converted into a...

Dijkstra’s Shortest Path Algorithm is used to find the shortest path in a graph, from one node to every other node in a graph. Start with...

Shell sort is a sorting algorithm that uses a gap between elements to compare the values. The gap between elements shrinks until is 0 and...

Quick sort is a recursive sorting algorithm. It uses the idea of divide et conquer. To solve the array, we have to choose a pivot, which...

Pigeonhole is a sorting algorithm. It works best if the number of elements in the array and the number of keys is similar. It is a...

Merge Sort is a Divide and Conquer Algorithm. It continuously divides in 2 the array, and then each divided part and so on until we have...

Insertion Sort algorithm is a sorting technique that arranges elements in an array. Many people compare it to the way that we sort...

This is an IOS App that recognizes people in images stored in your phone, or taken live with the canera. The code can be seen on github:...

Heap sort is a sorting algorithm based on comparing elements in a Binary Heap data structure. We first find the maximum element and place...

Object Recognizer This is an Android Studio App that recognizes objects and people using the camera of your phone. In order for it to...

This algorithm is best suited when memory writes or swap operations are costly. It is a sorting algorithm that changes values in place....

It is a simple app that permits uploading images and recognizing faces in them. The code is available here: https://github.com/oanaunc/Ap...