Find online courses made by experts from around the world.
Take your courses with you and learn anywhere, anytime.
Learn and practice realworld skills and achieve your goals.
Algorithms in C : Concepts, Examples, Code + Time Complexity (Recently updated : January 14, 2017!)
What's New: Time Complexity of Merge Sort, Extended Euclidean Algorithm in Number Theory section, New section on Transform and Conquer algorithms
Algorithms are very important for programmers to develop efficient software designing and programming skills. This Course introduces you to most important algorithms in computer science. Each video explains the concept/logic behind the algorithm, provides an example and explains pseudocode. Each video also has working C programs of algorithm implementations with sample input & output. This course will help you crack those programming interviews on algorithms.
Why Take this Course?
Most of the companies in today's world depend on software for their daily operations. How do these software take right decisions and keep these companies running in the right direction? Well, it's all in their programming. Programmers over the decades have been writing code which perform right operations in right conditions. This is done using Algorithms.
Taking this algorithms course will help you to understand how to implement logic in the form of a code in an optimal way and also enables you to write the programs efficiently. In this course you will learn how the most important and most common algorithms used in programming are designed and implemented. This course will kick start your journey in the world of programming with algorithms.
How is this course designed?
This Course is structured into following sections:
Overview: This section introduces you to the course, provides information about the author, course structure and gives you answers to some of the frequently asked questions by students.
Brute Force: This section explains the brute force approach to problem solving. You will understand the how the algorithms selection sort, bubble sort, sequential search and string matching work.
Divide and Conquer: This section deals with algorithms based on Divide and Conquer technique. Two sorting algorithms  quick sort and merge sort are explained.
Decrease and Conquer: In this section decrease and conquer approach and its variants are explained. Binary search and insertion sort algorithms are explained with an example.
Transform and Conquer: Significance of transformandconquer technique and algorithms like heapsort will be explained here. Lectures on Heaps, heap construction and heapsort algorithm are added. Each algorithm is explained with an example in a lucid way.
Dynamic Programming: This section explains how to solve problems with overlapping subproblems. Warshall's algorithm and Floyd's algorithm are explained.
Greedy Technique: This section explains algorithms based on Greedy technique. Section begins with explanation on minimum spanning tree concept. Two algorithms (Prim's and Kruskal's) to construct a minimum spanning tree of a given graph are explained stepbystep.
Number Theory : This section deals with the algorithms involving numerical computations. Euclid's Algorithm, ExtendedEuclidean Algorithm and RSA algorithm are explained with example.
Time Complexity : This section explains the importance of time complexity analysis, the asymptotic notations to denote the time complexity of algorithms.
Also, each algorithm's time complexity is explained in separate video lectures.
Students can benefit by learning about designing and implementing algorithms in C. Job Seekers can also benefit by using the information in preparing for their programming interviews.
Once you are enrolled, you get a life time access to all the resources and lectures in this course. This course is always evolving with new lectures, resources and quizzes to keep you uptodate. So take this course now and learn how to design and implement algorithms.
Not for you? No problem.
30 day money back guarantee.
Forever yours.
Lifetime access.
Learn on the go.
Desktop, iOS and Android.
Get rewarded.
Certificate of completion.
Section 1: Introduction  

Lecture 1 
Course Introduction and Author Bio
Preview

03:32  
Lecture 2 
Course Curriculum & Upcoming lectures
Preview

4 pages  
Section 2: Brute Force Approach  
Lecture 3  04:33  
Selection Sort : This video explains the selection sort algorithm. Selection sort is a brute force approach based algorithm. An example is explained to help you understand the logic before explaining the pseudocode of the selection sort algorithm. 

Lecture 4  05:25  
Bubble Sort : This video explains the bubble sort algorithm. Bubble sort is a brute force approach based algorithm. An example is explained to help you understand the logic before explaining the pseudocode of the bubble sort algorithm. 

Lecture 5  06:09  
Sequential Search : This video explains the sequential search algorithm. Sequential search is a brute force approach based algorithm. An example is explained to help you understand the logic before explaining the pseudocode of the sequential search algorithm. 

Lecture 6  06:38  
Brute Force String Match : This video explains the brute force string matching algorithm. As the name says this is a brute force approach based algorithm. An example is explained to help you understand the logic before explaining the pseudocode of the brute force string matching algorithm. 

Quiz 1 
Brute Force Quiz

4 questions  
Section 3: Divide and Conquer Approach  
Lecture 7  08:57  
Merge Sort : This video explains the merge sort algorithm. Merge sort is a divide and conquer approach based algorithm. An example is explained to help you understand the logic before explaining the pseudocode of the merge sort algorithm. 

Lecture 8  08:01  
Quick Sort : This video explains the quick sort algorithm. Quick sort is a divide and conquer approach based algorithm. An example is explained to help you understand the logic before explaining the pseudocode of the quick sort algorithm. 

Quiz 2 
Divide and Conquer Quiz

2 questions  
Section 4: Decrease and Conquer Approach  
Lecture 9  11:38  
Binary Search : This video explains the binary search algorithm. Binary search is a decrease and conquer paradigm based algorithm. An example is explained to help you understand the logic before explaining the pseudocode of the binary search algorithm. 

Lecture 10  04:46  
Insertion Sort : This video explains the insertion sort algorithm. Insertion sort is a decrease and conquer approach based algorithm. An example is explained to help you understand the logic before explaining the pseudocode of the insertion sort algorithm. 

Lecture 11  06:16  
Depth First Search(DFS) : This video explains the depth first search(DFS)algorithm. DFS is a decrease and conquer approach based algorithm. An example is explained to help you understand the logic before explaining the pseudocode of the depth first search(DFS) algorithm. 

Lecture 12  08:02  
Breadth First Search(BFS) : This video explains the breadth first search(BFS)algorithm. BFS is a decrease and conquer approach based algorithm. An example is explained to help you understand the logic before explaining the pseudocode of the breadth first search(BFS) algorithm. 

Quiz 3 
Decrease and Conquer Quiz

5 questions  
Section 5: Transform and Conquer Approach  
Lecture 13  06:23  
Heaps : This video discusses the transformandconquer technique. Heap sort is an algorithm that is based on transform and conquer technique. In order to understand the implementation of the algorithm, you need to know the concept if heap and its properties. This lecture explains the same. 

Lecture 14  08:36  
Heap Construction : This video explains how to construct a heap for a given list of numbers using bottomup approach. An example is explained to help you understand the logic before explaining the pseudocode of the HeapConstruction algorithm. You may download the source code in the resources section. 

Lecture 15  07:16  
Heap Sort : This video explains how to sort a given list of numbers using Heap Sort Algorithm. An example is explained to help you understand the logic before explaining the pseudocode of the Heap Sort algorithm. You may download the source code in the resources section. 

Section 6: Dynamic Programming  
Lecture 16  09:27  
Warshall's Algorithm : This video explains the Warshall's algorithm. Warshall's algorithm is based on dynamic programming. An example is explained to help you understand the logic before explaining the pseudocode of the Warshall's algorithm. Using the Warshall's algorithm we find the transitive closure of the given graph. 

Lecture 17  14:16  
Floyd's Algorithm : This video explains the Floyd's algorithm to solve all pairs shortestpaths problem. Floyd's algorithm is based on dynamic programming. An example is explained to help you understand the logic before explaining the pseudocode of the Floyd's algorithm. Using the Floyd's algorithm we find the lengths of shortest paths from each vertex to all other vertices in the given graph. 

Quiz 4 
Dynamic Programming Quiz

3 questions  
Section 7: Greedy Technique  
Lecture 18  10:08  
Prim's Algorithm : This video explains the Prim's algorithm to construct a minimum spanning tree for a connected weighted graph. Prim's algorithm is a greedy technique. An example is explained to help you understand the logic before explaining the pseudocode of the Prim's algorithm. 

Lecture 19  03:51  
Kruskal's Algorithm : This video explains the Kruskal's algorithm to construct a minimum spanning tree for a connected weighted graph. Kruskal's algorithm is a greedy technique. An example is explained to help you understand the logic before explaining the pseudocode of the Kruskal's algorithm. 

Quiz 5 
Greedy Technique Quiz

5 questions  
Section 8: Bonus Section : Time Complexity  
Lecture 20  07:36  
Introduction to Analysis of Algorithms: Merely knowing how algorithms work is not sufficient. It is very important and helpful to know how efficient the algorithms are. This video explains what is the need for analysis of algorithms. Also you will understand what is time complexity, order of growth and get an idea on how to find time complexity. 

Lecture 21  06:13  
Asymptotic Notations : This video helps you understand the different types of asymptotic notations, what they mean and how they are used to compare the orders of growth of algorithms. 

Lecture 22  03:21  
Selection Sort : This video explains how to calculate the time complexity of selection sort algorithm. 

Lecture 23  03:45  
Bubble Sort : This video explains how to calculate the time complexity of Bubble Sort algorithm. 

Lecture 24  02:51  
Sequential Search : This video explains how to calculate the time complexity of Sequential Search algorithm. 

Lecture 25  03:47  
String Matching : This video explains how to calculate the time complexity of Brute Force String Matching algorithm. 

Lecture 26  03:35  
Insertion Sort : This video explains how to calculate the time complexity of Insertion Sort algorithm. 

Lecture 27  01:58  
Warshall's Algorithm : This video explains how to calculate the time complexity of Warshall's algorithm. 

Lecture 28  02:13  
Floyd's Algorithm : This video explains how to calculate the time complexity of Floyd's Algorithm. 

Lecture 29  08:24  
This video explains what Master Theorem is and how it is useful in solving recurrence relations with examples. This is very helpful in analyzing algorithms involving recursive computation and in determining their time complexity. 

Lecture 30  04:41  
This video explains how to calculate the time complexity of Merge Sort Algorithm. In order to understand this lecture, you should know how to form the recurrence relations and the Master Theorem. Please watch our lecture on Master Theorem prior to this. Subtitles for this video will be added shortly. 

Quiz 6 
Time Complexity Quiz

6 questions  
Section 9: Number Theoretic Algorithms  
Lecture 31  05:39  
This video explains Euclid's Algorithm to find Greatest Common Divisor(GCD) of two integers. 

Lecture 32 
C Program on Euclid's Algorithm

4 pages  
Lecture 33  12:05  
This lecture is an extension of Euclid's Algorithm wherein the GCD of two integers a and b is found in addition to the coefficients x,y that are used to express the GCD in the form ax+by. The knowledge on this algorithm comes handy in understanding some more concepts in Number theory. 

Lecture 34  06:23  
RSA Algorithm : This video explains the RSA Algorithm to encrypt a message. An example is explained to help you understand the logic before explaining the pseudocode. You may download the source code in Clanguage in the resources section. 

Quiz 7 
Number Theory Quiz

3 questions 
Engineering Mentor is an online educational startup, providing educational resources to IT and non IT students. At Engineering Mentor, we create high quality resources in clear and easy to understand methods.
We have a team of qualified engineers who create resources to guide students through the toughest aspects of technical and non technical education.
Pratibha has a master's degree in Computer Science and has been involved with IT industry since 2010.
Pratibha has worked with Infosys Company for clients like Cisco. She is a CCNA Certified Test Engineer with experience in Automation and Manual Testing. Pratibha has been a part of Engineering Mentor expert teacher's group for over a year now and has been actively involved in online and offline teachings on software Testing.