| 0 | 0 B | ||
| 1. Arrays.mp4 | 27.7 MB | ||
| 1. Arrays.srt | 10.1 KB | ||
| 1. Complexities hierarchy.mp4 | 46.9 MB | ||
| 1. Introduction.mp4 | 14.7 MB | ||
| 1. Introduction.srt | 4 KB | ||
| 1. Quiz Analyze the complexity of First repeating character problem.html | 102.4 B | ||
| 1 | 0 B | ||
| 1. Complexities hierarchy.srt | 12.1 KB | ||
| 1. Linear search algorithm.mp4 | 26.2 MB | ||
| 1. Linear search algorithm.srt | 8.3 KB | ||
| 1. Nested loops == O(n²).mp4 | 25 MB | ||
| 1. Nested loops == O(n²).srt | 8 KB | ||
| 1.1 arrays.pptx | 902.5 KB | ||
| 1.1 complexities.pptx | 1.2 MB | ||
| 1.1 linear search.pptx | 989.1 KB | ||
| 1.1 nested loops == O(n²).pptx | 1.1 MB | ||
| 1.1 recursion complexity intro.pptx | 491.9 KB | ||
| 1.1 sorting algorithms intro.pptx | 492.8 KB | ||
| 1.1 what is complexity analysis.pptx | 1.3 MB | ||
| 1.2 linear_search.py | 102.4 B | ||
| 2 | 0 B | ||
| 10. Bucket sort.mp4 | 12 MB | ||
| 10. Bucket sort.srt | 4.1 KB | ||
| 10. String subsequences.mp4 | 22.8 MB | ||
| 10. String subsequences.srt | 6.7 KB | ||
| 10.1 bucket_sort.py | 409.6 B | ||
| 10.1 string subsequences.pptx | 912.9 KB | ||
| 10.2 bucket sort.pptx | 463 KB | ||
| 10.2 string subsequences.py | 409.6 B | ||
| 11. Quiz Analyze the complexity of Minimum cost path problem.html | 102.4 B | ||
| 11. Shell sort.mp4 | 24.4 MB | ||
| 11. Shell sort.srt | 11 KB | ||
| 11.1 shell_sort.py | 307.2 B | ||
| 11.2 shell sort.pptx | 1.1 MB | ||
| 12. Extra resource Summary.html | 409.6 B | ||
| 12. Minimum cost path.mp4 | 28.4 MB | ||
| 12. Minimum cost path.srt | 9.3 KB | ||
| 12.1 minimum cost path recup.pptx | 723 KB | ||
| 12.2 minimum cost path.py | 921.6 B | ||
| 13. Quiz Analyze the complexity of Longest consecutive sequence problem.html | 102.4 B | ||
| 14. Longest consecutive sequence.mp4 | 41.9 MB | ||
| 14. Longest consecutive sequence.srt | 14.5 KB | ||
| 14.1 longest consecutive sequence.pptx | 824.7 KB | ||
| 14.2 longest consecutive sequence.py | 2.1 KB | ||
| 15. Quiz Analyze the complexity of Longest common subsequence problem.html | 102.4 B | ||
| 16. Longest common subsequence.mp4 | 40 MB | ||
| 16. Longest common subsequence.srt | 11.4 KB | ||
| 16.1 longest common subsequence.py | 1.7 KB | ||
| 16.2 longest common subsequence.pptx | 783.6 KB | ||
| 17. Quiz Analyze the complexity of Subsets that sum up to k problem.html | 102.4 B | ||
| 18. Subsets that sum up to k.mp4 | 28.4 MB | ||
| 18. Subsets that sum up to k.srt | 8.8 KB | ||
| 18.1 subsets that sum up to k.py | 819.2 B | ||
| 18.2 subsets that sum up to k.pptx | 926.9 KB | ||
| 19. Quiz Analyze the complexity of Balanced binary tree problem.html | 102.4 B | ||
| 2. Binary search algorithm.mp4 | 48 MB | ||
| 2. Binary search algorithm.srt | 15.6 KB | ||
| 2. Common mistakes.mp4 | 23.2 MB | ||
| 2. Common mistakes.srt | 7.7 KB | ||
| 2. Examples.mp4 | 79.4 MB | ||
| 2. Examples.srt | 28.2 KB | ||
| 2. First repeating character.mp4 | 20.7 MB | ||
| 2. First repeating character.srt | 6.9 KB | ||
| 2. Insertion sort.mp4 | 14.7 MB | ||
| 2. Insertion sort.srt | 5.6 KB | ||
| 2. Linked lists, stacks, and queues.mp4 | 37.2 MB | ||
| 2. Linked lists, stacks, and queues.srt | 13.7 KB | ||
| 2. Quiz Analyze the complexity.html | 102.4 B | ||
| 2. Recursion tree method.mp4 | 31.3 MB | ||
| 2. Recursion tree method.srt | 11.5 KB | ||
| 2.1 binary search.pptx | 1.4 MB | ||
| 2.1 examples.pptx | 2.1 MB | ||
| 2.1 first repeating character.pptx | 609.8 KB | ||
| 2.1 insertion sort.pptx | 630.1 KB | ||
| 2.1 linked lists stacks queues.pptx | 1.3 MB | ||
| 2.1 mistakes.pptx | 825.6 KB | ||
| 2.1 using recursion tree.pptx | 854.1 KB | ||
| 2.2 binary_search.py | 307.2 B | ||
| 2.2 first repeating character.py | 512 B | ||
| 2.2 insertion_sort.py | 204.8 B | ||
| 3 | 81 KB | ||
| 20. Balanced binary tree.mp4 | 41.1 MB | ||
| 20. Balanced binary tree.srt | 11.2 KB | ||
| 20.1 balanced binary tree.pptx | 1 MB | ||
| 20.2 balanced binary tree.py | 921.6 B | ||
| 21. Quiz Analyze the complexity of Array permutations problem.html | 102.4 B | ||
| 22. Array permutations.mp4 | 28.1 MB | ||
| 22. Array permutations.srt | 6.8 KB | ||
| 22.1 array permutations.py | 512 B | ||
| 22.2 array permutations.pptx | 1.1 MB | ||
| 23. Quiz Analyze the complexity of Word search problem.html | 102.4 B | ||
| 24. Word search.mp4 | 28.1 MB | ||
| 24. Word search.srt | 7.6 KB | ||
| 24.1 word search.py | 1 KB | ||
| 24.2 word search.pptx | 1.2 MB | ||
| 25. Quiz Analyze the complexity of N-queens problem.html | 102.4 B | ||
| 26. N-queens.mp4 | 54.9 MB | ||
| 26. N-queens.srt | 12.6 KB | ||
| 26.1 n-queens.py | 819.2 B | ||
| 26.2 n-queens recup.pptx | 2.2 MB | ||
| 27. Bonus space-optimized dynamic programming.mp4 | 17.1 MB | ||
| 27. Bonus space-optimized dynamic programming.srt | 4.8 KB | ||
| 27.1 space-optimized dp.pptx | 428 KB | ||
| 3. Big-O, big-Ω, and big-θ notations.mp4 | 171.9 MB | ||
| 3. Big-O, big-Ω, and big-θ notations.srt | 39.4 KB | ||
| 3. Bubble sort.mp4 | 11.6 MB | ||
| 3. Bubble sort.srt | 4.7 KB | ||
| 3. Do we always need to optimize.mp4 | 16.1 MB | ||
| 3. Do we always need to optimize.srt | 4.6 KB | ||
| 3. Hash tables and sets.mp4 | 34.1 MB | ||
| 3. Hash tables and sets.srt | 12.6 KB | ||
| 3. How to analyze the complexity of an algorithm.mp4 | 92 MB | ||
| 3. How to analyze the complexity of an algorithm.srt | 32.5 KB | ||
| 3. Knuth-Morris-Pratt (KMP) algorithm.mp4 | 52.7 MB | ||
| 3. Knuth-Morris-Pratt (KMP) algorithm.srt | 19.4 KB | ||
| 3. Quiz Analyze the complexity of Maximum subarray problem.html | 102.4 B | ||
| 3. Recurrence relation method.mp4 | 41.5 MB | ||
| 3. Recurrence relation method.srt | 12.2 KB | ||
| 3.1 always optimize.pptx | 876.9 KB | ||
| 3.1 big O, big Omega, big Theta.pptx | 5.3 MB | ||
| 3.1 bubble_sort.py | 307.2 B | ||
| 3.1 hash tables and sets.pptx | 533.2 KB | ||
| 3.1 how to analyse complexity.pptx | 3 MB | ||
| 3.1 kmp algorithm.pptx | 1.2 MB | ||
| 3.1 using recurrence relation.pptx | 3.4 MB | ||
| 3.2 bubble sort.pptx | 539.3 KB | ||
| 3.2 kmp.py | 614.4 B | ||
| 4. Extra resource Notations mathematical definition.html | 2.5 KB | ||
| 4. Master theorem method.mp4 | 59.4 MB | ||
| 4. Master theorem method.srt | 12 KB | ||
| 4. Maximum subarray.mp4 | 29.5 MB | ||
| 4. Maximum subarray.srt | 10.5 KB | ||
| 4. Quiz Deduce the complexity from T(n).html | 102.4 B | ||
| 4 | 124.4 KB | ||
| 4. Selection sort.mp4 | 9.9 MB | ||
| 4. Selection sort.srt | 3.6 KB | ||
| 4. Trees.mp4 | 96.2 MB | ||
| 4. Trees.srt | 28.7 KB | ||
| 4.1 maximum subarray.py | 1 KB | ||
| 4.1 selection sort.pptx | 477.2 KB | ||
| 4.1 trees.pptx | 2.2 MB | ||
| 4.1 using master method.pptx | 2.5 MB | ||
| 4.2 maximum subarray.pptx | 1.3 MB | ||
| 4.2 selection_sort.py | 204.8 B | ||
| 5. Merge sort.srt | 9.4 KB | ||
| 5. Quiz Analyze the complexity of Peak finding problem.html | 102.4 B | ||
| 5. Quiz Big-O, big-Ω, and big-θ notations.html | 102.4 B | ||
| 5. Space complexity analysis of recursive functions.srt | 10.1 KB | ||
| 5 | 53.7 KB | ||
| 5. Amortized complexity.mp4 | 28.8 MB | ||
| 5. Amortized complexity.srt | 12.1 KB | ||
| 5. Mathematical proof of time complexity of building a binary heap.html | 204.8 B | ||
| 5. Merge sort.mp4 | 21.9 MB | ||
| 5. Space complexity analysis of recursive functions.mp4 | 26.8 MB | ||
| 5.1 amortized complexity.pptx | 797.4 KB | ||
| 5.1 merge_sort.py | 716.8 B | ||
| 6. Best, average, and worst case.mp4 | 39.6 MB | ||
| 6. Best, average, and worst case.srt | 13.3 KB | ||
| 6. Graphs.mp4 | 40.8 MB | ||
| 6. Graphs.srt | 11.7 KB | ||
| 6. Heapsort.mp4 | 22.2 MB | ||
| 6. Heapsort.srt | 9.3 KB | ||
| 6. How to compare two algorithms.mp4 | 29.8 MB | ||
| 6. How to compare two algorithms.srt | 7.9 KB | ||
| 6. Memoization.mp4 | 31.6 MB | ||
| 6 | 268.5 KB | ||
| 6. Memoization.srt | 11.5 KB | ||
| 6. Peak finding.mp4 | 19.3 MB | ||
| 6. Peak finding.srt | 7.9 KB | ||
| 6.1 best, average, and worst case.pptx | 1 MB | ||
| 6.1 graphs.pptx | 1 MB | ||
| 6.1 heapsort.pptx | 547.5 KB | ||
| 6.1 how to compare algorithms.pptx | 979.4 KB | ||
| 6.1 memoization.pptx | 735 KB | ||
| 6.1 peak finding.pptx | 742.7 KB | ||
| 6.2 heapsort.py | 614.4 B | ||
| 6.2 peak finding.py | 512 B | ||
| 7 | 424.8 KB | ||
| 7. Complexity classes.mp4 | 35.4 MB | ||
| 7. Complexity classes.srt | 10.3 KB | ||
| 7. Dynamic programming.mp4 | 33.1 MB | ||
| 7. Dynamic programming.srt | 10.4 KB | ||
| 7. Extra resource Summary.html | 4.9 KB | ||
| 7. Find pair that sums up to k problem analysis.mp4 | 50.6 MB | ||
| 7. Find pair that sums up to k problem analysis.srt | 16.4 KB | ||
| 7. Quicksort.mp4 | 40.9 MB | ||
| 7. Quicksort.srt | 13.7 KB | ||
| 7. Quiz Analyze the complexity of Palindrome linked list problem.html | 102.4 B | ||
| 7.1 complexity classes.pptx | 660.8 KB | ||
| 7.1 dynamic programming.pptx | 660.5 KB | ||
| 7.1 find_pair.py | 921.6 B | ||
| 7.1 quicksort.pptx | 989.4 KB | ||
| 7.2 find pair that sums up to k.pptx | 1.7 MB | ||
| 7.2 quicksort.py | 819.2 B | ||
| 7.3 quicksort rec tree.jpg?042148 | 851.9 KB | ||
| 8. Palindrome linked list.mp4 | 28.4 MB | ||
| 8. Palindrome linked list.srt | 10 KB | ||
| TutsNode.com.txt | 102.4 B | ||
| [TGx]Downloaded from torrentgalaxy.to .txt | 614.4 B | ||
| 8 | 22.7 KB | ||
| 8. Counting sort.mp4 | 29.8 MB | ||
| 8. Counting sort.srt | 8.2 KB | ||
| 8.1 counting sort.pptx | 717.6 KB | ||
| 8.1 palindrome linked list.pptx | 764.1 KB | ||
| 8.2 counting_sort.py | 409.6 B | ||
| 8.2 palindrome linked list.py | 1.1 KB | ||
| 9 | 116.9 KB | ||
| 9. Quiz Analyze the complexity of String subsequences problem.html | 102.4 B | ||
| 9. Radix sort.mp4 | 15.5 MB | ||
| 9. Radix sort.srt | 5.1 KB | ||
| 9.1 radix_sort.py | 614.4 B | ||
| 9.2 radix sort.pptx | 445.6 KB | ||
| 10 | 77.5 KB | ||
| 11 | 96.9 KB | ||
| 12 | 501.5 KB | ||
| 13 | 445.3 KB | ||
| 14 | 58.8 KB | ||
| 15 | 165.7 KB | ||
| 16 | 33.4 KB | ||
| 17 | 458.6 KB | ||
| 18 | 316.9 KB | ||
| 19 | 138.1 KB | ||
| 20 | 375.1 KB | ||
| 21 | 392.7 KB | ||
| 22 | 383.8 KB | ||
| 23 | 195.4 KB | ||
| 24 | 166.4 KB | ||
| 25 | 236.6 KB | ||
| 26 | 491.3 KB | ||
| 27 | 190.6 KB | ||
| 28 | 74.7 KB | ||
| 29 | 125.7 KB | ||
| 30 | 143.9 KB | ||
| 31 | 391.2 KB | ||
| 32 | 419.5 KB | ||
| 33 | 299.5 KB | ||
| 34 | 206.3 KB | ||
| 35 | 296.3 KB | ||
| 36 | 469.2 KB | ||
| 37 | 149.8 KB | ||
| 38 | 325.6 KB | ||
| 39 | 248.2 KB | ||
| 40 | 273.4 KB | ||
| 41 | 111.5 KB | ||
| 42 | 261.2 KB | ||
| 43 | 194.8 KB | ||
| 44 | 359.4 KB | ||
| 45 | 453.3 KB | ||
| 46 | 361 KB | ||
| 47 | 45 KB | ||
| 48 | 341.9 KB | ||
| 49 | 355.8 KB | ||
| 50 | 488.5 KB | ||
| 51 | 365.2 KB | ||
| 52 | 138.4 KB | ||
| 53 | 167.6 KB | ||
| 54 | 65 KB | ||
| 55 | 473.8 KB | ||
| 56 | 35.5 KB | ||
| 57 | 297 KB | ||
| 58 | 308.2 KB | ||
| 59 | 361 KB | ||
| 60 | 271.3 KB | ||
| 61 | 57.9 KB | ||
| 62 | 189.5 KB | ||
| 63 | 190.7 KB | ||
| 64 | 206.5 KB | ||
| 65 | 267.8 KB | ||
| 66 | 269.1 KB | ||
| 67 | 280.5 KB | ||
| 68 | 371.8 KB | ||
| 69 | 397.8 KB | ||
| 70 | 410.4 KB | ||
| 71 | 470 KB | ||
| 72 | 485.6 KB | ||
| 73 | 485.9 KB | ||
| 74 | 34.6 KB | ||
| 75 | 34.9 KB | ||
| 76 | 44.6 KB | ||
| 77 | 97.1 KB | ||
| 78 | 111.1 KB | ||
| 79 | 121.5 KB | ||
| 80 | 147.1 KB | ||
| 81 | 169.9 KB | ||
| 82 | 172.1 KB | ||
| 83 | 198.4 KB | ||
| 84 | 199.3 KB | ||
| 85 | 226.6 KB | ||
| 86 | 240.4 KB | ||
| 87 | 259.9 KB | ||
| 88 | 281.3 KB | ||
| 89 | 289 KB | ||
| 90 | 301 KB | ||
| 91 | 306.4 KB | ||
| 92 | 363.3 KB | ||
| 93 | 363.5 KB | ||
| 94 | 393.9 KB | ||
| 95 | 414.2 KB | ||
| 96 | 476.5 KB | ||
| 97 | 484.7 KB | ||
| ▲ 305 total files | |||
Description
You have issues with time and space complexity analysis? No worries, get ready to take a detailed course on time and space complexity analysis that will teach you how to analyze the time and space complexity of an algorithm, an important skill to have in computer science and competitive programming!
The course contains both theory and practice, theory to get all the knowledge you need to know about complexity analysis (notations, input cases, amortized complexity, complexity analysis of data structures…) and practice to apply that knowledge to analyze the time and space complexity of different algorithms!
And to make your learning experience better, the course will have quizzes, extra resources, captions, animations, slides, good audio/video quality…et cetera. And most importantly, the ability to ask the instructor when you don’t understand something!
Hours and hours of researching, writing, animating, and recording, to provide you with this amazing course, don’t miss it out!
The course will cover:
Complexity analysis basics
Big-O, big-Omega, and big-Theta notations
Best, average, and worst case
Complexities hierarchy
Complexity classes (P vs NP problem)
How to analyze the time and space complexity of an algorithm
How to compare algorithms efficiency
Amortized complexity analysis
Complexity analysis of searching algorithms
Complexity analysis of sorting algorithms
Complexity analysis of recursive functions
Complexity analysis of data structures main operations
Common mistakes and misconceptions
Complexity analysis of some popular interview coding problems
Hope to see you in the course!
Who this course is for:
Programmers
Computer science students
Engineering students
Competitive programmers
Self-taught developers
Requirements
Basic programming knowledge
Last Updated 3/2021
| torrent name | size | uploader | age | seed | leech |
|---|---|---|---|---|---|
| 506.8 MB | freecoursewb | 2 weeks | 0 | 0 | |
|
Udemy - Conversations That Drive Team Outcomes - First-Time Managers Posted by
freecoursewb in Other
|
608.7 MB | freecoursewb | 1 month | 0 | 0 |
| 1.3 GB | freecoursewb | 1 month | 0 | 0 | |
| 439.4 MB | freecoursewb | 2 months | 0 | 1 | |
| 841.8 MB | freecoursewb | 3 months | 39 | 4 |
All Comments