Tutorial by Topics: algorithms

A greedy algorithm is an algorithm in which in each step we choose the most beneficial option in every step without looking into the future. The choice depends only on current profit. Greedy approach is usually a good approach when each profit can be picked up in every step, so no choice blocks ...

Boost Documention on String Algrorithms

Theory Definition 1: An optimization problem Π consists of a set of instances ΣΠ. For every instance σ∈ΣΠ there is a set Ζσ of solutions and a objective function fσ : Ζσ → ℜ≥0 which assigns apositive real value to every solution. We say OPT(σ) is the value of an optimal solution, A(σ) is the s...

Algorithms are a backbone to computing. Making a choice of which algorithm to use in which situation distinguishes an average from good programmer. With that in mind, here are definitions and code examples of some of the basic algorithms out there.

Examples for some multithreaded algorithms. parallel before a loop means each iteration of the loop are independant from each other and can be run in parallel. spawn is to indicate creation of a new thread. sync is to synchronize all created threads. Arrays/matrix are indexed 1 to n in exam...

Top 7 Resources to Help You Learn Data Structures and Algorithms Today, if you want to get into computer science, you need to understand its fundamental concepts. Without them, you won’t have a solid understanding of the topic and therefore you probably won’t succeed in this field. But how can stude...