Introduction to Algorithms

Introduction to Algorithms

English | MP4 | AVC 1280×720 | AAC 48KHz 2ch | 2 Hours | 316 MB

Algorithms are a fundamental topic in computer science, power many of the largest companies today and are used in making many decisions that affect our day to day lives – in obvious places like Google’s PageRank algorithm to more obscure use cases like national security and local policing.

In this introductory course, we’re going to take our first steps towards understanding the world of algorithms and data structures. Before we can study individual algorithms we’re going to spend time learning how to evaluate algorithms, how to make comparisons and how to develop algorithmic thinking

What you’ll learn

  • Algorithmic thinking
  • Time and space complexity
  • Big O notation
  • Linear and binary search
Table of Contents

01 What Is an Algorithm
02 Guess the Number
03 Defining an Algorithm
04 Evaluating Linear Search
05 Evaluating Binary Search
06 Efficiency of an Algorithm
07 Constant and Logarithmic Time
08 Linear & Quadratic Time
09 Quasilinear Time
10 Exponential Time
11 Determining Complexity
12 Linear Search in Code
13 Binary Search in Code
14 Recursive Binary Search
15 Recursive Functions
16 Space Complexity
17 Recap