Visualize graph algorithms like dijkstra, BFS, DFS

The process in which a function calls itself directly or indirectly is called recursion

Compare different sorting algorithms

The N queens puzzle is the problem of placing N chess queens on an N*N chessboard so that no two queens threaten each other

Visualize how Seive is better than brute force

The convex hull of a set of points is the smallest convex polygon that contains all the points of it

Binary search is an efficient algorithm for finding an item from a sorted list of item