# Algorithms in C : Concepts, Examples, Code + Time Complexity

**5 hours**left at this price!

- 3.5 hours on-demand video
- 27 downloadable resources
- Full lifetime access
- Access on mobile and TV

- Certificate of Completion

Get your team access to 4,000+ top Udemy courses anytime, anywhere.

Try Udemy for Business- Learn the concepts behind Most Popular Algorithms used in Computer Science
- Understand how algorithms work with the help of diagrams, examples and pseudocode
- Practise Algorithm Implementation with the help of included Programs in C language
- Understand how to use algorithms to implement most important logics in any programming.

**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 pseudo-code of the selection sort algorithm.

**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 pseudo-code of the brute force string matching algorithm.

**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 pseudo-code of the depth first search(DFS) algorithm.

**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 pseudo-code of the breadth first search(BFS) algorithm.

**Heap Construction : **This video explains how to construct a heap for a given list of numbers using **bottom-up approach**. An example is explained to help you understand the logic before explaining the pseudo-code of the HeapConstruction algorithm.

You may download the source code in the resources section.

**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 pseudo-code of the Warshall's algorithm. Using the Warshall's algorithm we find the transitive closure of the given graph.

**Floyd's Algorithm :** This video explains the Floyd's algorithm to solve all pairs shortest-paths problem. Floyd's algorithm is based on dynamic programming. An example is explained to help you understand the logic before explaining the pseudo-code 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.

**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 pseudo-code of the Prim's algorithm.

**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 pseudo-code of the Kruskal's algorithm.

**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.

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.*

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.

- Basic Knowledge of any programming language, preferably 'C'
- A C compiler and Editor to practise the algorithm programs
- Interest in Algorithms and programming
- No additional knowledge is required
- You will need a computer with internet to access lectures and resources

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.

- Computer Science Students who are taking Algorithms as an Academic Course
- IT students and Developers who want to learn how to design and implement logic for any programs
- Job aspirants who want to want to be successful at Developer Interviews
- Non IT Students who wish to understand logic for writing efficient code
- Anyone interested in learning most popular algorithms