Nov 15, 20201 minSelection sortThe algorithm divides the input list into two parts: a sorted sublist of items which is built up from left to right at the front (left)...

Aug 12, 20201 minLinear searchA linear search is used on a collection of items. It relies on the technique of traversing a list from start to end by exploring...

Jul 21, 20202 minMinimum Spanning TreeWhat is a Spanning Tree? Given an undirected and connected graph G=(V, E), a spanning tree of the graph G is a tree that spans G (that...

Jul 21, 20204 minDynamic programming introductionIf break up a problem into a series of overlapping sub-problems, and build up solutions to larger and larger sub-problems. If a problem...

Jul 7, 20201 minDepth First SearchDepth First Search (DFS) The DFS algorithm uses the idea of backtracking. It involves exhaustive searches of all the nodes by going...

Jul 5, 20202 minBreadth First SearchGraph traversals Graph traversal means visiting every vertex and edge exactly once in a well-defined order. While using certain graph...

May 3, 20202 minHeap sortHeap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection sort where we first...