Algorithm Analysis
0.0 (0 ratings)
0 students enrolled
Wishlisted Wishlist

# Algorithm Analysis

Understand and solve algorithms using Big O, Big Omega, and Theta time complexity.
New
0.0 (0 ratings)
0 students enrolled
Created by Rodney Anderson
Last updated 9/2017
English
English [Auto-generated]
Current price: \$10 Original price: \$20 Discount: 50% off
5 hours left at this price!
30-Day Money-Back Guarantee
Includes:
• 1.5 hours on-demand video
• 10 Articles
• Access on mobile and TV
• Certificate of Completion
What Will I Learn?
• Analyze the asymptotic growth of a program
• Analyze the time complexity of many algorithms
• Compare programs
View Curriculum
Requirements
• You should have basic algebra skills
• You should have a basic understanding of programming
Description

In this algorithm analysis course you will learn the definitions of Big O, Bog Omega, and Theta. By the end of the course you will understand what these terms mean , why we use them, and how to solve algorithms and programs with them. This is a short course and only takes about 90 minutes to complete. In this course there are plenty of examples and quizzes to learn from so that you are sure to understand the lectures and the material.

Who is the target audience?
• Anyone who wants to learn about analyzing programs, functions, and algorithms in general.
Compare to Other Algorithms Courses
Curriculum For This Course
21 Lectures
01:42:27
+
An Introduction To Algorithms and Algorithm Analysis
2 Lectures 05:54

Welcome to this course on Algorithm Analysis.
In this lecture is an introduction to algorithm analysis, and why it is important.

Introduction
01:35

In this lecture you will learn about a few algorithms.

• Greedy Algorithm (used to give back the least amount of coins)
• Divide and Conquer Algorithm
• Sorting Algorithms
Algorithms
04:19

Introduction Quiz
5 questions
+
Asymptotics
7 Lectures 34:54
Asymptotics Introduction
01:14

Preview 09:18

Preview 07:07

What is Big Omega
06:19

Solve/Prove Big Omega
04:21

What is Big Theta ?
00:41

Solve/Prove Big Theta
05:53

Asymptotic Quiz
6 questions
+
Analyzing Code and Algorithms
11 Lectures 01:02:50
Growth of Functions
00:40

Introduction to Analyzing Code
02:34

Analyzing Loops Using Summations
09:10

Analyzing Code Complexity
10:19

Bubble Sort Algorithm
02:53

Analyzing Bubble Sort Best and Worst Case
12:48

Introduction to Analyzing Recursive Algorithms
01:26

Change a Program to Recurrence Relation
02:55

Analyzing Recursive Functions Using Master Theorem
06:50

Analyzing Recursive Functions Using Iterative Substitution
08:08

Solving Recurrence Relation
6 questions

Practice Problems
05:06
+
Conclusion
1 Lecture 00:17
Thank You !
00:17