* Cantinho Satkeys

Refresh History
  • FELISCUNHA: Votos de um santo domingo para todo o auditório  4tj97u<z
    03 de Novembro de 2024, 10:49
  • j.s.: bom fim de semana  43e5r6 49E09B4F
    02 de Novembro de 2024, 08:37
  • j.s.: ghyt74 a todos  4tj97u<z
    02 de Novembro de 2024, 08:36
  • FELISCUNHA: ghyt74   49E09B4F  e bom feriado   4tj97u<z
    01 de Novembro de 2024, 10:39
  • JPratas: try65hytr Pessoal  h7ft6l k7y8j0
    01 de Novembro de 2024, 03:51
  • j.s.: try65hytr a todos  4tj97u<z
    30 de Outubro de 2024, 21:00
  • JPratas: dgtgtr Pessoal  4tj97u<z k7y8j0
    28 de Outubro de 2024, 17:35
  • FELISCUNHA: Votos de um santo domingo para todo o auditório  k8h9m
    27 de Outubro de 2024, 11:21
  • j.s.: bom fim de semana   49E09B4F 49E09B4F
    26 de Outubro de 2024, 17:06
  • j.s.: dgtgtr a todos  4tj97u<z
    26 de Outubro de 2024, 17:06
  • FELISCUNHA: ghyt74   49E09B4F  e bom fim de semana
    26 de Outubro de 2024, 11:49
  • JPratas: try65hytr Pessoal  101yd91 k7y8j0
    25 de Outubro de 2024, 03:53
  • JPratas: dgtgtr A Todos  4tj97u<z 2dgh8i k7y8j0
    23 de Outubro de 2024, 16:31
  • FELISCUNHA: ghyt74  pessoal   49E09B4F
    23 de Outubro de 2024, 10:59
  • j.s.: dgtgtr a todos  4tj97u<z
    22 de Outubro de 2024, 18:16
  • j.s.: dgtgtr a todos  4tj97u<z
    20 de Outubro de 2024, 15:04
  • FELISCUNHA: Votos de um santo domingo para todo o auditório  101041
    20 de Outubro de 2024, 11:37
  • axlpoa: hi
    19 de Outubro de 2024, 22:24
  • FELISCUNHA: ghyt74   49E09B4F  e bom fim de semana  4tj97u<z
    19 de Outubro de 2024, 11:31
  • j.s.: ghyt74 a todos  4tj97u<z
    18 de Outubro de 2024, 09:33

Autor Tópico: Complete Algorithms Complexity and Big O Notation Course  (Lida 87 vezes)

0 Membros e 1 Visitante estão a ver este tópico.

Online mitsumi

  • Moderador Global
  • ***
  • Mensagens: 115675
  • Karma: +0/-0
Complete Algorithms Complexity and Big O Notation Course
« em: 07 de Abril de 2021, 11:13 »

MP4 | Video: h264, 1280x720 | Audio: AAC, 44.1 KHz, 2 Ch
Genre: eLearning | Language: English + srt | Duration: 16 lectures (1h 57m) | Size: 582.2 MB
From beginner to professional in 2 hours!

What you'll learn:
Algorithm Time and Space Complexity Evaluation
Big O Notation
Interview Coding Tasks Review
Time Complexity Cases
Time Complexities Comparison
Mathematical Comparison of Functions
Typical Complexities Evaluation
log N Complexity
Strings and Complexity Evaluation
Recursive Algorithms Complexity
Amortized Analysis
Space Complexity

Requirements
Basic programming skills (you need to know how to write an "if-else" clause and a "for" loop)

Description
To develop effective code, each developer needs to know how to evaluate the complexity of the algorithms.

The course "Big O Notation. Algorithms Complexity Evaluation." in simple language explains the mathematics behind the complexity of algorithms, cases of complexity, the complexity of recursion, strings, amortized analysis and space complexity. In addition we solve 15 examples, some of which are found in interviews on Google, Facebook, Amazon.

We have reworked many books and articles to the most effective for perception and understanding form. As a result this course is independent by its nature and does not require studying of any additional materials. Basic programming skills is the only requirement to understand the course!

Important note: you can always pause the video and process into every aspect of the material in detail!

Who this course is for
Beginners who want to understand from scratch to professional what complexity evaluation is
Developers of any level who want to pass an interview at companies such as Google, Facebook, Apple
Developers who want to learn how to write effective code
Beginner developers curious about time complexity evaluation and Big O Notation


Download link:
Só visivel para registados e com resposta ao tópico.

Only visible to registered and with a reply to the topic.

Links are Interchangeable - No Password - Single Extraction