Algorithms Analysis and Design from Scratch

Master Efficiency, Complexity, and Advanced Problem Solving

Lessons 30
Duration ~ 13 hours
Study Hours 25 - 50

This course is available via:

Plan Courses Price Action
Coding Only ⓘ 4
$160 $120 / 12 months 24 months
EGP 8,000 EGP 6,000 / 12 months 24 months
Subscribe
Algo & DS ⓘ 2
$70 / year
EGP 3,500 / year
Subscribe

Or subscribe to it individually:

This course only
$40 / year
EGP 2,000 / year
Subscribe

What Will You Learn

Algorithm Complexity & Big O

Master Big O notation, analyze calculus functions.

Mathematical Modeling

Translate mathematical concepts like standard deviation into efficient code.

Divide & Conquer

Leverage recursion to build high-performance algorithms like Merge Sort and Binary Search.

Greedy Algorithms

Solve optimization challenges using Activity Selection, Huffman Coding, and Fractional Knapsack techniques.

Dynamic Programming (DP)

Tackle complex overlapping subproblems efficiently with models like Stagecoach, LCS, and 0/1 Knapsack.

Graph Theory & Traversal

Implement essential graph data structures and master Breadth-First (BFS) and Depth-First (DFS) searches.

Shortest Path & MST

Find optimal routes and network connections using Dijkstra’s Algorithm and Prim’s Minimum Spanning Tree.

From Theory to Clean Code

Bridge the gap between abstract algorithmic design and practical, working implementation.

Prerequisites

In order to start this course you must have these skills:

Programming Fundamentals

Proficiency in one Programming language.

OOP

Object Oriented Programming Basics.

Basic Mathematics

Algebra.

Recommended Courses:

Node.js and JavaScript

Instructor

Instructor Avatar

Ahmed Metwally

Software Industry Expert

24+ Years of Experience

I am on a mission to elevate the efficiency of the software industry in the Arab world by developing highly skilled and knowledgeable software engineers. My courses are carefully designed to equip them with the essential expertise needed to excel in the market.

Course Content

Chapter 1: Basics & Standard Deviation
4 lessons 1.2 hour
1 - Circle Area – Algorithm – Model – Code
21 min
2 - Sigma Notation – Standard Deviation – Algorithm
20 min
3 - Standard Deviation – Model
23 min
4 - Standard Deviation – Code
10 min
Chapter 2: Algorithms Analysis
5 lessons 2 hour
5 - Algorithms Analysis – Introduction
13 min
6 - Algorithms Analysis – Calculus Function sample
26 min
7 - Algorithms Analysis – Big O Notation
31 min
8 - Algorithms Analysis – Drawing Complexity classes on graph
17 min
9 - Insertion Sort – Algorithm – Code – Analysis
34 min
Chapter 3: Divide & Conquer
6 lessons 2.1 hour
10 - Recursion – Divide & Conquer – Merge Sort – Algorithm
25 min
11 - Divide & Conquer – Merge Sort – Code
27 min
12 - Divide & Conquer – Merge Sort – Analysis
17 min
13 - Binary Search – Algorithm – Code
20 min
14 - Segregate Positive and Negative Numbers – Algorithm
15 min
15 - Segregate Positive and Negative Numbers – Code
20 min
Chapter 4: Calculus & Greedy Algorithms
7 lessons 3.5 hour
16 - Calculus – Optimization Problems – Max Profit Example
22 min
17 - Greedy Algorithm – Introduction
13 min
18 - Greedy Algorithm – Activity Selection Problem – Algorithm – Code
22 min
19 - Sorted Characters Frequencies – Algorithm – Code
52 min
20 - Greedy Algorithm – Huffman Coding – Algorithm sample
36 min
21 - Greedy Algorithm – Huffman Coding – Code sample
40 min
22 - Greedy Algorithm – Fractional Knapsack Problem – Algorithm – Code
26 min
Chapter 5: Dynamic Programming
3 lessons 1.7 hour
23 - Dynamic Programming – Stagecoach Problem – Algorithm – Code
48 min
24 - Dynamic Programming – Longest Common Subsequence – Algorithm – Code
28 min
25 - Dynamic Programming – 0/1 Knapsack Problem – Algorithm – Code
24 min
Chapter 6: Graphs
5 lessons 2 hour
26 - Graph – Introduction
17 min
27 - Graph – Prim’s Minimum Spanning Tree – Algorithm – Code
25 min
28 - Graph – Breadth First Search – Algorithm – Code
39 min
29 - Graph – Depth First Search – Algorithm – Code
10 min
30 - Graph – Dijkstra’s Shortest Path – Algorithm – Code
27 min