• ## Depth First Search (DFS)

Depth-first Tree Traversal Why is this important? This workshop is important because: We can traverse trees or graphs in many orders. Depth-first traversal is a very common tree traversal pattern. For some problems, it’s more appropriate than breadth-first search. What are the objectives? After this workshop, developers will be able...

• ## Quick Sort

QuickSort Algorithm Tutorial This Algorithm has a time complexity of O(N*logN) and it’s called QuickSort. QuickSort uses Divide-n-Conquer recursive algorithm to sort the values. Basic Idea of QuickSort 1. Pick an element in the array as the pivot element. 2. Make a pass to the array, called the PARTITION step,...

• ## Sieve of Eratosthenes

Sieve of Eratosthenes Sieve of Eratosthenes is an algorithm for finding all the prime numbers in a segment —- [ 1 ; n ] using O(n log log n) operations. The idea is simple: at the beginning we write down a row of numbers and eliminate all numbers divisible by...

• ## Knapsack Algorithm

Hi, It is my first blog post about Knapsack Algorithm. Let’s Start What is it? The Knapsack Algorithm (Knap) is piece of Cambinatoric and Dynamic Programming. Firstly, let me explain about knapsack, the main problem of Knapsack is, given a set of items, each with a weight and a value,...