Full video course with a 50% discount: https://cronis.by/video-course-sale/
Free training: https://cronis.by/video-materials/
Promo code YT_20 for a 20% discount on the new live online course: https://cronis.by/online-cart

Video courses:
➤ Full course with difficulty rating: https://www.udemy.com/course/big-o-ru...
➤ Full course on binary numbers: https://www.udemy.com/course/binary_s...
➤ Full course on binary trees: https://www.udemy.com/course/cronis_b...

This video will cover the basics of Big O and algorithm complexity estimation:
➥ What is Big O;
➥ Where does log N come from in algorithms;
➥ How to evaluate algorithms;
➥ Solutions to typical Big O problems.

We'll discuss algorithm complexity estimation and algorithm complexity, as well as what Big O is.

This video is part of a lecture from the Cronis School: http://cron.is

Contents:
⌚ 02:27 A Real-World Big O Example
⌚ 03:37 Time Complexity Estimation
⌚ 10:30 Dropping Constants in Complexity Estimation
⌚ 14:30 Addition and Multiplication of Complexities
⌚ 15:38 Log N Execution Time
⌚ 18:40 Complexity Estimation Examples

✎ Google, Facebook, and Yandex Problems: Google задачи. Задача восстановления текст...

Individual Topics from Scratch:
➤ Binary System: Двоичная система счисления. Максимально пр...
➤ Turing Machine: Машина Тьюринга. Принцип работы компьютера
➤ Induction: Лекция 02. Математическая индукция с нуля....
➤ Recursion: Рекурсия. Полная теория. Часть 1/2

You can read more here: Cracking the Coding Interview by Gayle Laakmann McDowell
The author of the book above uses materials from: Steven S. Skiena, The Algorithm Design Manual
The video uses examples from these books.

Telegram: https://t.me/cronisby
Email: info@cron.is
#Big_O #logN #Algorithm_Complexity_Estimation #Big_O #binary_search #binary_search