Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Algorithms in C : Concepts, Examples, Code + Time Complexity
Introduction
Course Introduction and Author Bio (3:33)
Course Curriculum & Upcoming lectures
Brute Force Approach
Selection Sort Algorithm (4:35)
Bubble Sort Algorithm (5:27)
Sequential Search Algorithm (6:11)
Brute Force String Matching Algorithm (6:40)
Brute Force Quiz
Divide and Conquer Approach
Merge Sort Algorithm (8:59)
Quick Sort Algorithm (8:03)
Divide and Conquer Quiz
Decrease and Conquer Approach
Binary Search Algorithm (11:40)
Insertion Sort Algorithm (4:48)
Depth First Search Algorithm (6:18)
Breadth First Search Algorithm (8:04)
Decrease and Conquer Quiz
Transform and Conquer Approach
Heaps (6:25)
Heap Construction [bottom-up approach] (8:38)
Heap Sort Algorithm (7:18)
Dynamic Programming
Warshall's Algorithm (9:29)
Floyd's Algorithm (14:18)
Dynamic Programming Quiz
Greedy Technique
Prim's Algorithm (10:10)
Kruskal's Algorithm (3:52)
Greedy Technique Quiz
Bonus Section : Time Complexity
Introduction to Analysis of Algorithms (7:38)
Asymptotic Notations (6:15)
Time Complexity - Selection Sort Algorithm (3:22)
Time Complexity - Bubble Sort Algorithm (3:46)
Time Complexity - Sequential Search Algorithm (2:52)
Time Complexity - String Matching Algorithm (3:48)
Time Complexity - Insertion Sort Algorithm (3:36)
Time Complexity - Warshall's Algorithm (1:59)
Time Complexity - Floyd's Algorithm (2:14)
Master Theorem (8:26)
Time Complexity Quiz
Number Theoretic Algorithms
Euclid's Algorithm [GCD of two numbers] (5:41)
C Program on Euclid's Algorithm
RSA Algorithm (6:23)
Number Theory Quiz
Heap Construction [bottom-up approach]
Lesson content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock