Recurrence Relation Made Easy

A guide to solving any recursion program, or recurrence relation.
4.0 (2 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.
29 students enrolled
Take This Course
  • Lectures 9
  • Length 1.5 hours
  • Skill Level All Levels
  • Languages English
  • Includes Lifetime access
    30 day money back guarantee!
    Available on iOS and Android
    Certificate of Completion
Wishlisted Wishlist

How taking a course works


Find online courses made by experts from around the world.


Take your courses with you and learn anywhere, anytime.


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

About This Course

Published 1/2015 English

Course Description

This course is a simplified course for solving recursive functions using different methods to solve them such as the Master Theorem, Iterative Substitution, and Induction. In this course the student will be able to solve the running time of a recursive function or algorithm using terms like Big-Oh, Big-Theta, or Big Omega. This course is great for anyone taking a course in computer science, computer engineering, mathematics, Information Technology or anyone who wants to understand how programmers compare code.

This course is targeted to computer science, computer engineering and Information Technology students wanting to learn how to solve recurrence relations and gain a deeper understanding about asymptotic such as Big-Oh, Big-Theta, and Big –Omega, or anyone in a technical field.

Included in the course are video lessons, quizzes, and PDF documents with examples of recurrence relation problems, and examples of how to solve them. Each quiz is a multiple-choice quiz, and each answer has an explanation for reasons why it’s wrong or right. Each document comes from the video lesson, so while the student is watching the videos s/he will be able to pause read over and review the document.

The student will learn how solve recurrence relations and come out with an understanding of Asymptotic within just 63min. that's about the time it would take for one day of a computer science class!

This course is structured first by a video lesson on the subject at hand and then a quiz afterwards to make sure the student understood the material in the video lesson. The lessons start off with an introductory lesson on recurrence relation and then each preceding lesson will build upon the previous.

Students should take this course for an easy to understand explanation of recurrence relations and different ways to solve them in less then the time it would take for a professor at a university to teach the subject.

What are the requirements?

  • Students should have a basic understanding of programming and algebra

What am I going to get from this course?

  • solve the running time of algorithms and programs
  • change a recursive function into a recurrence relation

Who is the target audience?

  • Any computer science, computer engineering, or IT student should take this course

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.


Section 1: Understanding Recurrence Relations

This is an introductory video on recurrence relation, here I define a recurrence relation and give examples.

3 questions

It's always good to be able to identify a recurrence relation


Learn how to convert a recursion function into a recurrence relation.

3 questions

These are quizzes on converting a recursion function into a recurrence relation

Section 2: Solve Asymptotics (Big-Oh, Big-Theta, and Big-Omega)

Learn what the terms like Big O, Big Theta, and Big Omega mean.

5 questions

These quizzes will help students to better understand Big Oh.


This video gives an understanding of Big - Omega


This lecture is on Big - Theta and how to solve it.

5 questions

Quizzes on Big Theta

Section 3: Solve Recurrence Relation Running TIme

Learn how to solve recurrence relation running time using the iterative substitution method.


Learn how to solve recurrence relation running time using the Master Theorem.

6 questions

In this quiz you will solve recurrence relations.

16 pages

This is a ebook guide from all of the lectures put into one, with some more advance solutions to solve recurrence relations, enjoy !


A few practice problems with answers, to help your learning !

Students Who Viewed This Course Also Viewed

  • Loading
  • Loading
  • Loading

Instructor Biography

Rodney Anderson, Programmer

Hi ,

My name is Rodney Anderson, I am a Programmer Analyst at Siemens AG, and a graduate of the University of Central Florida. I got have my bachelors of science degree in Computer Science and am currently taking master courses in computer science with a speciality in cloud computing. I have worked at Siemens in the IT department for almost 3 years now, and have learned so much about the business and IT. With my experience at Siemens I have created my own website where I thought I would share information on computer science topics to students for free,and all in one place. At the same time I was able to improve my web programming skills. I have made videos on mathematics and programming online.

I enjoy playing basketball, football, volleyball, tennis, biking, making videos and exercising in general. I watch allot of videos on mathematics, physics, and technology for leisure time. I would like to travel around the world someday soon. Programming allows me to create my own world using my own rules. Usually if I am not at work or at the gym I am helping friends and family to program. My future plans are to create an android game for fun, have my masters degree in computer science, making tutorial videos at home, and spend more time with friends and family.

Ready to start learning?
Take This Course