Greedy Algorithm: A Beginner's Guide

Design Optimization: What’s Behind It?

How to design algorithms with fairness in mind

(Boosting randomized algorithms) Imagine that you have an algorithm for solving a decision problem.Suppose that the algorithm makes a decision at random and returns the correct answer with probability(1)/(2) δ with some δ > 0, that is, it is just a bit better than a random guess. To improve the performance,we run the algorithm n times and take the majority vote. Show that, for any ϵ∈ (0, 1), the answer iscorrect with probability at least 1 - ϵ, as long as n ≥(1)/(2δ^2)ln((1)/(ϵ)).For example,

Distributed Randomized Algorithms for Convex and Non-Convex Optimization - Electrical and Computer Engineering

Sorting Algorithms | Brilliant Math & Science Wiki

Sorting Algorithms in Python (Animation-Based)