* Cantinho Satkeys

Refresh History
  • cereal killa: boas gomes, 4tj97u<z
    14 de Julho de 2025, 21:32
  • j.s.: cereal enviei pm  4tj97u<z
    14 de Julho de 2025, 21:13
  • j.s.: Entre as 20h do dia 13 de agosto de 2025 e as 10h do dia 14 de agosto de 2025 (horário CEST).
    14 de Julho de 2025, 20:55
  • j.s.: foi refeita nova data para migração
    14 de Julho de 2025, 20:55
  • j.s.: 43e5r6
    14 de Julho de 2025, 16:49
  • j.s.: por isso o forum deve estar off line  Início: 16/07/2025 às 20:00 (CEST) Fim: 17/07/2025 às 10:00 (CEST)
    14 de Julho de 2025, 16:49
  • j.s.: vai ser efectuada migração de servidores
    14 de Julho de 2025, 16:48
  • j.s.: dgtgtr a todosc 49E09B4F
    14 de Julho de 2025, 16:47
  • cunha45: ja
    14 de Julho de 2025, 08:25
  • j.s.: passem por aqui p.f. [link]
    13 de Julho de 2025, 16:29
  • FELISCUNHA: Votos de um santo domingo para todo o auditório  4tj97u<z
    13 de Julho de 2025, 11:31
  • j.s.: tenham um excelente domingo 49E09B4F
    13 de Julho de 2025, 09:07
  • j.s.: ghyt74 a todos  49E09B4F
    13 de Julho de 2025, 09:07
  • JPratas: try65hytr Pessoal  4tj97u<z classic k7y8j0
    11 de Julho de 2025, 03:54
  • FELISCUNHA: ghyt74  pessoal   49E09B4F
    10 de Julho de 2025, 10:40
  • j.s.: dgtgtr a todos  4tj97u<z
    07 de Julho de 2025, 13:50
  • FELISCUNHA: Votos de um santo domingo para todo o auditório  4tj97u<z
    06 de Julho de 2025, 11:43
  • j.s.: [link]
    05 de Julho de 2025, 16:31
  • j.s.: dgtgtr a todos  4tj97u<z
    05 de Julho de 2025, 16:31
  • j.s.: h7t45 ao convidado de Honra batatinha pela sua ajuda
    05 de Julho de 2025, 16:30

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

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

Offline mitsumi

  • Sub-Administrador
  • ****
  • Mensagens: 121842
  • 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