Sorting

Sorting algorithms are ways to organize an array of items from smallest to largest. These algorithms can be used to organize messy data and make it easier to use, so here is the visualization of some famous sorting algorithms. Perhaps these were the algorithms used by the sorting hat , who knows ? Go find out

Pathfinding

Hey want to go from point A to point B and wondering which is the shortest path among all the paths possible. Well here is a visualization of some classic pathfinding algorithms go and find out which one among them is the best!

P.S : An awesome story

Number Theory

Suffering from numerophobia? Scared of number theory? Say no more to those and see how efficiently prime numbers are found using the classic Sieve of Eratosthenes method introduced to the world by ancient ol' greek mathematicians.

Backtracking

Backtracking is a general algorithm for finding solutions to some computational problems, notably constraint satisfaction problems, that incrementally builds candidates to the solutions, and abandons a candidate ("backtracks") as soon as it determines that the candidate cannot possibly be completed to a valid solution.

Convex Hull

Given a set of points in the plane. the convex hull of the set is the smallest convex polygon that contains all the points of it. Jarvis's algorithm and Graham's scan algorithm is used to find convex hull for a given set of points. Jarvis algorithm works in O(n^2) time whereas Graham's Scan works in O(n*logn) time.