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 pseudo-code. 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 transform-and-conquer technique and algorithms like heap-sort 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 sub-problems. 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 step-by-step.
Number Theory : This section deals with the algorithms involving numerical computations. Euclid's Algorithm, Extended-Euclidean 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 up-to-date. So take this course now and learn how to design and implement algorithms.
