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

Learn algorithms in C language. Understand Logic with examples, practice code and crack those programming interviews!
4.1 (24 ratings) Instead of using a simple lifetime average, Udemy calculates a
course's star rating by considering a number of different factors
such as the number of ratings, the age of ratings, and the
likelihood of fraudulent ratings.
1,773 students enrolled
$19
$100
81% off
Take This Course
  • Lectures 32
  • Length 3.5 hours
  • Skill Level All Levels
  • Languages English, captions
  • Includes Lifetime access
    30 day money back guarantee!
    Available on iOS and Android
    Certificate of Completion
Wishlisted Wishlist

How taking a course works

Discover

Find online courses made by experts from around the world.

Learn

Take your courses with you and learn anywhere, anytime.

Master

Learn and practice real-world skills and achieve your goals.

About This Course

Published 9/2015 English Closed captions available

Course Description

Algorithms in C : Concepts, Examples, Code + Time Complexity (Recently updated : February 16, 2016!)

What's New: New section on Transform and Conquer algorithms,Time Complexity Quiz, Master Theorem, Number Theoretic 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, 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.

What are the requirements?

  • 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

What am I going to get from this course?

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

What is the target audience?

  • 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

What you get with this course?

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.

Curriculum

Section 1: Introduction
Course Introduction and Author Bio
Preview
03:32
Course Curriculum & Upcoming lectures
Preview
4 pages
Section 2: Brute Force Approach
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 pseudo-code of the selection sort algorithm.

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.

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.

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

Brute Force Quiz
4 questions
Section 3: Divide and Conquer Approach
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 pseudo-code of the merge sort algorithm.

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

Divide and Conquer Quiz
2 questions
Section 4: Decrease and Conquer Approach
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.

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

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

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

Decrease and Conquer Quiz
5 questions
Section 5: Transform and Conquer Approach
06:23

Heaps : This video discusses the transform-and-conquer 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.

08:36

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.

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 pseudo-code of the Heap Sort algorithm.

You may download the source code in the resources section.

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

14:16

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.

Dynamic Programming Quiz
3 questions
Section 7: Greedy Technique
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 pseudo-code of the Prim's algorithm.

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

Greedy Technique Quiz
5 questions
Section 8: Bonus Section : Time Complexity
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.

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.

03:21

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

03:45

Bubble Sort : This video explains how to calculate the time complexity of Bubble Sort algorithm.

02:51

Sequential Search : This video explains how to calculate the time complexity of Sequential Search algorithm.

03:47

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

03:35

Insertion Sort : This video explains how to calculate the time complexity of Insertion Sort algorithm.

01:58

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

02:13

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

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.

Time Complexity Quiz
6 questions
Section 9: Number Theoretic Algorithms
05:39

This video explains Euclid's Algorithm to find Greatest Common Divisor(GCD) of two integers.

C Program on Euclid's Algorithm
4 pages
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 amy download the source code in C-language in the resources section.

Number Theory Quiz
3 questions

Students Who Viewed This Course Also Viewed

  • Loading
  • Loading
  • Loading

Instructor Biography

Engineering Mentor, Courses for IT students

Engineering Mentor is an online educational start-up, 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.

Instructor Biography

Pratibha B., IT Professional, Instructor

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.


Ready to start learning?
Take This Course