种子简介

种子名称： Udemy - Mastering Data Structures & Algorithms using C and C++
文件类型： 视频
文件数目： 352个文件
文件大小： 7.01 GB
收录时间： 2019-5-9 21:28
已经下载： 3次
资源热度： 96
最近下载： 2024-6-27 00:46

下载BT种子文件

下载Torrent文件(.torrent) 立即下载

磁力链接下载

magnet:?xt=urn:btih:8850554ec3c38900822191e825a1a9dcf9163642&dn=Udemy - Mastering Data Structures & Algorithms using C and C++ 复制链接到迅雷、QQ旋风进行下载，或者使用百度云离线下载。

喜欢这个种子的人也喜欢

种子包含的文件

Udemy - Mastering Data Structures & Algorithms using C and C++.torrent

01. Before we Start/1. Instructor's Note.mp47.21MB

02. Essential C and C++ Concepts/1. Arrays Basics.mp419.45MB

02. Essential C and C++ Concepts/10. Structures and Functions (Must Watch).mp416.1MB

02. Essential C and C++ Concepts/11. Converting a C program to a C++ class (Must Watch).mp428.25MB

02. Essential C and C++ Concepts/12. C++ Class and Constructor.mp425.14MB

02. Essential C and C++ Concepts/13. Template classes.mp438.25MB

02. Essential C and C++ Concepts/2. Structures.mp447.82MB

02. Essential C and C++ Concepts/3. Pointers.mp430.4MB

02. Essential C and C++ Concepts/4. Reference in C++.mp410.42MB

02. Essential C and C++ Concepts/5. Pointer to Structure.mp417.25MB

02. Essential C and C++ Concepts/6. Functions.mp433.52MB

02. Essential C and C++ Concepts/7. Parameter Passing Methods.mp439.74MB

02. Essential C and C++ Concepts/8. Array as Parameter.mp420.95MB

02. Essential C and C++ Concepts/9. Structure as Parameter.mp430.07MB

03. Required Setup for Programming/1. Setup Dev-C++.mp47.01MB

03. Required Setup for Programming/2. Setup CodeBlocks.mp47.52MB

03. Required Setup for Programming/3. Setup Xcode.mp47.58MB

04. Introduction/1. Introduction.mp438.79MB

04. Introduction/2. Stack vs Heap Memory.mp425.54MB

04. Introduction/3. Stack vs Heap. Continued....mp436.71MB

04. Introduction/4. Physical vs Logical Data Structures.mp421.64MB

04. Introduction/5. ADT.mp439.03MB

04. Introduction/6. Time and Space Complexity.mp451.42MB

04. Introduction/7. Time and Space Complexity from Code.mp426.28MB

05. Recursion/1. How Recursion Works ( Tracing ).mp451.49MB

05. Recursion/10. Tree Recursion.mp450.53MB

05. Recursion/11. Let's Code Tree Recursion.mp46.96MB

05. Recursion/12. Indirect Recursion.mp412.15MB

05. Recursion/13. Let's Code Indirect Recursion.mp43.66MB

05. Recursion/14. Nested Recursion.mp417.75MB

05. Recursion/15. Let's Code Nested Recursion.mp42.81MB

05. Recursion/16. Sum of Natural Number using Recursion.mp426.13MB

05. Recursion/17. Let's Code Sum of N using Recursion.mp45.81MB

05. Recursion/18. Factorial using Recursion.mp411.58MB

05. Recursion/19. Let's Code Factorial using Recursion.mp46.49MB

05. Recursion/2. Generalising Recursion.mp45.78MB

05. Recursion/20. Power using Recursion.mp433.8MB

05. Recursion/21. Let's Code Power Recursion.mp44.22MB

05. Recursion/22. Taylor Series using Recursion.mp434.37MB

05. Recursion/23. Let's Code Taylor Series using Recursion.mp44.58MB

05. Recursion/24. Taylor Series using Horner's Rule.mp426.27MB

05. Recursion/25. Let's Code Taylor Series Horner's Rule - Recursion.mp42.49MB

05. Recursion/26. Let's Code Taylor Series Iterative.mp42.36MB

05. Recursion/27. Fibonacci Series using Recursion - Memoization.mp448.39MB

05. Recursion/28. Let's Code Fibonacci.mp416.9MB

05. Recursion/29. nCr using Recursion.mp423.85MB

05. Recursion/3. How Recursion uses Stack.mp433.19MB

05. Recursion/30. Let's Code nCr using Recursion.mp45.59MB

05. Recursion/31. Tower of Hanoi Problem.mp471.78MB

05. Recursion/32. Let's Code Tower of Hanoi.mp44.28MB

05. Recursion/34. Quiz 1 Solutions.mp486.04MB

05. Recursion/4. Recurrence Relation - Time Complexity of Recursion.mp430.56MB

05. Recursion/5. Lets Code Recursion.mp415.18MB

05. Recursion/6. Static and Global Variables in Recursion.mp423.62MB

05. Recursion/7. Let's Code Static and Global in Recursion.mp48.39MB

05. Recursion/8. Tail Recursion.mp421.13MB

05. Recursion/9. Head Recursion.mp414.36MB

06. Arrays Representations/1. Introduction to Array.mp410.34MB

06. Arrays Representations/10. Array Representation by Compiler.mp421.86MB

06. Arrays Representations/11. Row Major Formula for 2D Arrays.mp424.11MB

06. Arrays Representations/12. Column Major Formula for 2D Arrays.mp415.84MB

06. Arrays Representations/13. Formulas for nD Arrays.mp427.86MB

06. Arrays Representations/14. Formulas for 3D Arrays.mp48.75MB

06. Arrays Representations/2. Declarations of Array.mp415.79MB

06. Arrays Representations/3. Demo - Array Declaration.mp45.82MB

06. Arrays Representations/4. Static vs Dynamic Arrays.mp422.46MB

06. Arrays Representations/5. Demo - Static vs Dynamic Array.mp45.64MB

06. Arrays Representations/6. How to Increase Array Size.mp413.9MB

06. Arrays Representations/7. Demo - Increasing Array Size.mp49.1MB

06. Arrays Representations/8. 2D Arrays.mp425.76MB

06. Arrays Representations/9. Demo - 2D Array.mp48.15MB

07. Array ADT/1. Array ADT.mp411.25MB

07. Array ADT/10. Binary Search.mp425.02MB

07. Array ADT/11. Binary Search Algorithm.mp417.18MB

07. Array ADT/12. Let's Code Binary Search.mp48.4MB

07. Array ADT/13. Analysis of Binary Search.mp431.8MB

07. Array ADT/14. Average Case Analysis of Binary Search.mp428.48MB

07. Array ADT/15. Get( ) Set( ) Avg( ) Max( ) functions on Array.mp434.9MB

07. Array ADT/16. Let's Code Get() Set() Max() on Array.mp410.57MB

07. Array ADT/17. Reverse and Shift an Array.mp426.65MB

07. Array ADT/18. Lest's Code Reversing an Array.mp47.14MB

07. Array ADT/19. Check if Array is Sorted.mp439.6MB

07. Array ADT/2. Demo - Array ADT.mp415.8MB

07. Array ADT/20. Let's Code to check if Array is Sorted.mp412.82MB

07. Array ADT/21. Merging Arrays.mp421.68MB

07. Array ADT/22. Let's Code to Merge Arrays.mp49.83MB

07. Array ADT/23. Set operations on Array - Union, Intersection and Difference.mp429.22MB

07. Array ADT/24. Let's Code Set operations on Array.mp412.87MB

07. Array ADT/25. Let's Code a Menu Driver program for Arrays.mp410.75MB

07. Array ADT/26. Let's convert C program for Array to C++.mp424.2MB

07. Array ADT/27. Let's Put all together in C++ program for Array.mp420.28MB

07. Array ADT/28. Student Challenge Finding Single Missing Element in an Array.mp427.83MB

07. Array ADT/29. Student Challenge Finding Multiple Missing Elements in an Array.mp420.63MB

07. Array ADT/3. Inserting in an Array.mp427.01MB

07. Array ADT/30. Student Challenge Finding Missing Element in an Array Method 2.mp421.2MB

07. Array ADT/31. Student Challenge Finding Duplicates in a Sorted Array.mp431.65MB

07. Array ADT/32. Student Challenge Finding Duplicates in Sorted Array using Hashing.mp420.28MB

07. Array ADT/33. Student Challenge Finding Duplicates in a Unsorted Array.mp433.72MB

07. Array ADT/34. Stuart. Challenge Finding a Pair of Elements with sum K.mp432.7MB

07. Array ADT/35. Student Challenge Finding a Pair of Elements with sum K in Sorted Array.mp419.42MB

07. Array ADT/36. Student Challenge Finding Max and Min in a single Scan.mp422.42MB

07. Array ADT/4. Let's Code Insert.mp48.57MB

07. Array ADT/5. Deleting from Array.mp415.98MB

07. Array ADT/6. Let's Code Delete.mp47.03MB

07. Array ADT/7. Linear Search.mp428.65MB

07. Array ADT/8. Improving Linear Search.mp410.94MB

07. Array ADT/9. Let's Code Linear Search.mp47.66MB

08. Strings/1. Introduction to Strings.mp459.14MB

08. Strings/10. Checking if 2 Strings are Anagram.mp434.45MB

08. Strings/11. Permutation of String.mp478.62MB

08. Strings/2. Finding Length of a String.mp411.81MB

08. Strings/3. Changing Case of a String.mp419.95MB

08. Strings/4. Counting Words and Vowels in a String.mp422.53MB

08. Strings/5. Validating a String.mp414.72MB

08. Strings/6. Reversing a String.mp421.71MB

08. Strings/7. Comparing Strings and Checking Palindrome.mp428.28MB

08. Strings/8. Finding Duplicates in a String.mp432MB

08. Strings/9. Finding Duplicates in a String using Bitwise Operations.mp461.38MB

09. Matrices/1. Section Introduction.mp42.73MB

09. Matrices/10. Upper Triangular Matrix Row-Major Mapping.mp419.52MB

09. Matrices/11. Upper Triangular Matrix Column-Major Mapping.mp49.76MB

09. Matrices/12. Symmetric Matrix.mp46.9MB

09. Matrices/13. Tri-Diagonal and Tri-Band Matrix.mp427.26MB

09. Matrices/14. Toeplitz Matrix.mp420.67MB

09. Matrices/15. Menu Driven Program for Matrices.mp442.2MB

09. Matrices/16. Menu Driven Program for Matrices using Functions.mp413.35MB

09. Matrices/17. How to Write C++ Classes for All Matrices.mp432.89MB

09. Matrices/2. Diagonal Matrix.mp424.33MB

09. Matrices/3. Let's Code Diagonal Matrix.mp49.3MB

09. Matrices/4. C++ class for Diagonal Matrix.mp438.71MB

09. Matrices/5. Let's Code C++ class for Diagonal matrix.mp48.45MB

09. Matrices/6. Lower Triangular Matrix Row-Major Mapping.mp426.75MB

09. Matrices/7. Lower Triangular Matrix Column-Major Mapping.mp419.17MB

09. Matrices/8. Let's Code Lower Triangular Matrix in C.mp415.65MB

09. Matrices/9. Let's Code Lower Triangular Matrix in C++.mp412.89MB

10. Sparse Matrix and Polynomial Representation/1. Sparse Matrix Representation.mp424.81MB

10. Sparse Matrix and Polynomial Representation/10. Polynomial Evaluation.mp410.81MB

10. Sparse Matrix and Polynomial Representation/11. Polynomial Addition.mp425.5MB

10. Sparse Matrix and Polynomial Representation/12. Let's Code Polynomial.mp420.64MB

10. Sparse Matrix and Polynomial Representation/2. Addition of Sparse Matrices.mp427.32MB

10. Sparse Matrix and Polynomial Representation/3. Array Representation of Sparse Matrix.mp430.32MB

10. Sparse Matrix and Polynomial Representation/4. Let's Code to Create Sparse Matrix.mp412.54MB

10. Sparse Matrix and Polynomial Representation/5. Program for Adding Sparse Matrix.mp442.3MB

10. Sparse Matrix and Polynomial Representation/6. Let's Code to Add Sparse Matrix.mp416.62MB

10. Sparse Matrix and Polynomial Representation/7. Let's Code Sparse Matrix using C++.mp410.87MB

10. Sparse Matrix and Polynomial Representation/8. Let's Code Sparse Matrix using C++ Continued......mp418.56MB

10. Sparse Matrix and Polynomial Representation/9. Polynomial Representation.mp429.76MB

11. Linked List/1. Why we need Dynamic Data Structure Linked List.mp424.76MB

11. Linked List/10. Let's Code Count and Sum.mp410.36MB

11. Linked List/11. Maximum Element in a Linked List.mp415.77MB

11. Linked List/12. Let's Code Max for Linked List.mp44.14MB

11. Linked List/13. Searching in a Linked List.mp412MB

11. Linked List/14. Improve Searching in Linked List.mp423.27MB

11. Linked List/15. Let's Code Searching in Linked List.mp410.09MB

11. Linked List/16. Inserting in a Linked List.mp447.5MB

11. Linked List/17. Let's Code Insert for Linked List.mp47.95MB

11. Linked List/18. Creating a Linked List using Insert.mp46.11MB

11. Linked List/19. Creating a Linked List by Inserting at Last.mp418.03MB

11. Linked List/2. About Linked List.mp425.86MB

11. Linked List/20. Inserting in a Sorted Linked List.mp419.96MB

11. Linked List/21. Let's Code Insert in Sorted Linked List.mp46.81MB

11. Linked List/22. Deleting from Linked List.mp432MB

11. Linked List/23. Let's Code Delete on Linked List.mp47.49MB

11. Linked List/24. Check if a Linked List is Sorted.mp421.29MB

11. Linked List/25. Let's Code to check if Linked List is Sorted.mp43.09MB

11. Linked List/26. Remove Duplicates from Linked List.mp416.12MB

11. Linked List/27. Let's Code to Remove Duplicates from Linked List.mp43.2MB

11. Linked List/28. Reversing a Linked List.mp417.55MB

11. Linked List/29. Reversing using Sliding Pointers.mp427.46MB

11. Linked List/3. More About Linked List.mp419.76MB

11. Linked List/30. Recursive Reverse for Linked List.mp411.4MB

11. Linked List/31. Let's Code Reversing a Linked List.mp48.4MB

11. Linked List/32. Concatenating 2 Linked Lists.mp47.64MB

11. Linked List/33. Merging 2 Linked Lists.mp436.28MB

11. Linked List/34. Let's Code to Concatenate and Merge Linked Lists.mp411.12MB

11. Linked List/35. Check for LOOP in Linked List.mp423.45MB

11. Linked List/36. Let's Code to Check LOOP.mp44.83MB

11. Linked List/37. Let's Code a C++ class for Linked List.mp421.26MB

11. Linked List/38. Circular Linked List.mp417.72MB

11. Linked List/39. Display Circular Linked List.mp421.93MB

11. Linked List/4. Display Linked List.mp415.76MB

11. Linked List/40. Le's Code Circular Linked List.mp48.47MB

11. Linked List/41. Inserting in a Circular Linked List.mp426.87MB

11. Linked List/42. Let's Code Insert for a Circular Linked List.mp47.44MB

11. Linked List/43. Deleting From Circular Linked List.mp417.19MB

11. Linked List/44. Let's Code for Circular Linked List.mp46.07MB

11. Linked List/45. Doubly Linked List.mp411.2MB

11. Linked List/46. Let's Code Doubly Linked List.mp46.44MB

11. Linked List/47. Insert in a Doubly Linked List.mp425.37MB

11. Linked List/48. Let's Code Insert for Doubly Linked List.mp45.14MB

11. Linked List/49. Deleting from Doubly Linked List.mp422.1MB

11. Linked List/5. Let's Code Display for Linked List.mp412.18MB

11. Linked List/50. Let's Code Delete for Doubly Linked List.mp45.46MB

11. Linked List/51. Reverse a Doubly Linked List.mp414.27MB

11. Linked List/52. Let's Code Reverse for Doubly Linked List.mp42.75MB

11. Linked List/53. Circular Doubly Linked List.mp419.36MB

11. Linked List/54. Comparison of Linked List.mp430.18MB

11. Linked List/55. Comparison of Array with Linked List.mp428.43MB

11. Linked List/56. Student Challenge Finding Middle Element of a Linked List..mp429.53MB

11. Linked List/57. Student Challenge Finding Intersecting point of Two Linked List.mp425.4MB

11. Linked List/6. Recursive Display of Linked List.mp438.06MB

11. Linked List/7. Le's Code Recursive Display for Linked List.mp44.62MB

11. Linked List/8. Counting Nodes in a Linked List.mp427.55MB

11. Linked List/9. Sum of All Elements in a Linked List.mp411.06MB

12. Sparse Matrix and Polynomial using Linked List/1. Student Challenge Sparse Matrix using Linked List.mp425.97MB

12. Sparse Matrix and Polynomial using Linked List/2. Student Challenge Polynomial Representation using Linked List.mp418.72MB

12. Sparse Matrix and Polynomial using Linked List/3. Let's Code Polynomial.mp410.41MB

13. Stack/1. Introduction to Stack.mp432.63MB

13. Stack/10. Program for Parenthesis Matching.mp428.09MB

13. Stack/11. Let's Code Parenthesis Matching.mp45.2MB

13. Stack/12. More on Parenthesis Matching.mp419.66MB

13. Stack/13. Infix to Postfix Conversion.mp453.49MB

13. Stack/14. Associativity and Unary Operators.mp440.35MB

13. Stack/15. Infix to Postfix using Stack Method 1.mp421.99MB

13. Stack/16. Infix to Postfix using Stack Method 2.mp410.82MB

13. Stack/17. Program for Infix to Postfix Conversion.mp427.59MB

13. Stack/18. Let's Code Infix to Postfix Conversion.mp411.32MB

13. Stack/19. Student Challenge Infix to Postfix with Associativity and Parenthesis.mp429.99MB

13. Stack/2. Stack using Array.mp427.26MB

13. Stack/20. Evaluation of Postfix Expression.mp429.75MB

13. Stack/21. Program for Evaluation of Postfix.mp424.45MB

13. Stack/22. Let's Code Evaluation of Postfix.mp46.96MB

13. Stack/3. Implementation os Stack using Array.mp445.34MB

13. Stack/4. Let's Code Stack using Array.mp415.6MB

13. Stack/5. Stack using Linked List.mp413.94MB

13. Stack/6. Stack Operations using Linked List.mp428.2MB

13. Stack/7. Let's Code Stack using Linked List.mp49.2MB

13. Stack/8. Let's Code C++ class for Stack using Linked List.mp47.52MB

13. Stack/9. Parenthesis Matching.mp421.15MB

14. Queues/1. Queue ADT.mp414.18MB

14. Queues/10. Queue using Linked List.mp424.11MB

14. Queues/11. Let's Code Queue using Linked List.mp46.89MB

14. Queues/12. Double Ended Queue DEQUEUE.mp415.45MB

14. Queues/13. Priority Queues.mp434.54MB

14. Queues/14. Queue using 2 Stacks.mp421.24MB

14. Queues/2. Queue using Single Pointer.mp411.33MB

14. Queues/3. Queue using Two Pointers.mp424.03MB

14. Queues/4. Implementing Queue using Array.mp426.17MB

14. Queues/5. Let's Code Queue using Array.mp47.83MB

14. Queues/6. Let's Code Queue in C++.mp47.48MB

14. Queues/7. Drawback of Queue using Array.mp414.13MB

14. Queues/8. Circular Queue.mp433.21MB

14. Queues/9. Let's Code Circular Queue.mp44.07MB

15. Trees/1. Terminology.mp429.39MB

15. Trees/10. Representation of Binary Tree.mp412.27MB

15. Trees/11. Linked Representation of Binary Tree.mp49.03MB

15. Trees/12. Full vs Complete Binary Tree.mp414.87MB

15. Trees/13. Strict vs Complete Binary Tree.mp410.55MB

15. Trees/14. Binary Tree Traversals.mp419.81MB

15. Trees/15. Binary Tree Traversal Easy Method 1.mp46.04MB

15. Trees/16. Binary Tree Traversal Easy Method 2.mp47.13MB

15. Trees/17. Binary Tree Traversal Easy Method 3.mp49.22MB

15. Trees/18. Creating Binary Tree.mp417.51MB

15. Trees/19. Program to Create Binary Tree.mp410.82MB

15. Trees/2. Number of Binary Trees using N Nodes.mp431.12MB

15. Trees/20. Let's Code Creating Binary Tree.mp418.21MB

15. Trees/21. Let's Code Creating Binary Tree in C++.mp435.12MB

15. Trees/22. Preorder Tree Traversal.mp430.61MB

15. Trees/23. Inorder Tree Traversals Functions.mp424.07MB

15. Trees/24. Iterative Preorder.mp423.52MB

15. Trees/25. Iterative Inorder.mp423.61MB

15. Trees/26. Let's Code Iterative Traversals.mp48.36MB

15. Trees/27. Level Order Traversal.mp414.65MB

15. Trees/28. Let's Code Level Order Traversal.mp44.45MB

15. Trees/29. Can we Generate Tree from Traversals.mp415.66MB

15. Trees/3. Height vs Nodes in Binary Tree.mp432.5MB

15. Trees/30. Generating Tree from Traversals.mp417.37MB

15. Trees/31. Height and Count of Binary Tree.mp423.17MB

15. Trees/32. Let's Code Height and Count.mp44.16MB

15. Trees/33. Student Challenge Count Leaf Nodes of a Binary Tree.mp425.92MB

15. Trees/4. Internal Nodes vs External Nodes in Binary Tree.mp47.6MB

15. Trees/5. Strict Binary Tree.mp45.74MB

15. Trees/6. Height vs Node of String Binary Tree.mp49.91MB

15. Trees/7. Internal vs External Nodes of Strict Binary Trees.mp43.33MB

15. Trees/8. n-ary Trees.mp416.09MB

15. Trees/9. Analysis of n-Ary Trees.mp420.1MB

16. Binary Search Trees/1. BST intro.mp412.22MB

16. Binary Search Trees/10. Program for Generating BST from Preorder.mp416.18MB

16. Binary Search Trees/11. Drawbacks of Binary Search Tree.mp410.77MB

16. Binary Search Trees/2. Searching in a Binary Search Tree.mp422.5MB

16. Binary Search Trees/3. Inserting in a Binary Search Tree.mp415.38MB

16. Binary Search Trees/4. Recursive Insert in Binary Search Tree.mp415.98MB

16. Binary Search Trees/5. Creating a Binary Search Tree.mp45.94MB

16. Binary Search Trees/6. Let's code Binary Search Tree.mp417.3MB

16. Binary Search Trees/7. Deleting from Binary Search Tree.mp423.42MB

16. Binary Search Trees/8. Let's Code Recursive Insert and Delete on BST.mp423.74MB

16. Binary Search Trees/9. Generating BST from Preorder.mp421.07MB

17. AVL Trees/1. Introduction to AVL Trees.mp413.18MB

17. AVL Trees/2. Inserting in AVL with Rotations.mp434.98MB

17. AVL Trees/3. General for of AVL Rotations.mp432.23MB

17. AVL Trees/4. Let's Code LL Rotation on AVL.mp422.97MB

17. AVL Trees/5. Let's Code LR Rotation on AVL.mp46.73MB

17. AVL Trees/6. Generating AVL Tree.mp429.62MB

17. AVL Trees/7. Deletion from AVL Tree with Rotations.mp418.71MB

17. AVL Trees/8. Height Analysis of AVL Trees.mp428.36MB

18. Heap/1. Introduction to Heap.mp49.8MB

18. Heap/2. Inserting in a Heap.mp416.76MB

18. Heap/3. Program to Insert in a Heap.mp411.05MB

18. Heap/4. Creating a Heap.mp426.66MB

18. Heap/5. Deleting from Heap and Heap Sort.mp429.47MB

18. Heap/6. Let's Code Heap Sort.mp418.3MB

18. Heap/7. Heapify - Faster Method for creating Heap.mp421.63MB

18. Heap/8. Heap as Priority Queue.mp418.54MB

19. Sorting Techniques/1. Criteria used for Analysing Sorts.mp420.81MB

19. Sorting Techniques/10. Selection Sort.mp426.75MB

19. Sorting Techniques/11. Program for Selection Sort.mp46.5MB

19. Sorting Techniques/12. Analysis of Selection Sort.mp47.41MB

19. Sorting Techniques/13. Let's Code Selection Sort.mp43.15MB

19. Sorting Techniques/14. Idea behind Quick Sort.mp415.73MB

19. Sorting Techniques/15. Quick Sort.mp419.84MB

19. Sorting Techniques/16. Analysis of Quick Sort.mp423.34MB

19. Sorting Techniques/17. Analysis of Quick Sort Continued......mp430.67MB

19. Sorting Techniques/18. Let's Code Quick Sort.mp48.17MB

19. Sorting Techniques/19. Merging.mp441.94MB

19. Sorting Techniques/2. Bubble Sort.mp447.99MB

19. Sorting Techniques/20. Iterative Merge Sort.mp428.54MB

19. Sorting Techniques/21. Let's Code Iterative Merge Sort.mp49.82MB

19. Sorting Techniques/22. Recursive Merge Sort.mp444.66MB

19. Sorting Techniques/23. Let's Code Recursive Merge Sort.mp43.72MB

19. Sorting Techniques/24. Count Sort.mp429.43MB

19. Sorting Techniques/25. Let's Code Count Sort.mp48.12MB

19. Sorting Techniques/26. Bin Bucket Sort.mp425.9MB

19. Sorting Techniques/27. Radix Sort.mp433.89MB

19. Sorting Techniques/28. Shell Sort.mp450.5MB

19. Sorting Techniques/29. Let's Code Shell Sort.mp43.76MB

19. Sorting Techniques/3. Let's Code Bubble Sort.mp47.81MB

19. Sorting Techniques/4. Insertion Sort.mp414.16MB

19. Sorting Techniques/5. Insertion Sort Continued.....mp420.73MB

19. Sorting Techniques/6. Program for Insertion Sort.mp411.42MB

19. Sorting Techniques/7. Analysis of Insertion Sort.mp49.73MB

19. Sorting Techniques/8. Let's Code Insertion Sort.mp43.07MB

19. Sorting Techniques/9. Comparing Bubble and Insertion Sort.mp46.46MB

20. Hashing Technique/1. Introduction to Hashing.mp443.5MB

20. Hashing Technique/2. Chaining.mp442.74MB

20. Hashing Technique/3. Let's Code Chaining.mp48.77MB

20. Hashing Technique/4. Linear Probing.mp447.05MB

20. Hashing Technique/5. Let's Code Linear Probing.mp412.07MB

20. Hashing Technique/6. Quadratic Probing.mp412.17MB

20. Hashing Technique/7. Double Hashing.mp424.45MB

20. Hashing Technique/8. Hash Function Ideas.mp424.8MB

21. Graphs/1. Introduction to Graphs.mp423.06MB

21. Graphs/10. Prim's Minimum Cost Spanning Tree.mp419.02MB

21. Graphs/11. Kruskal's Minimum Cost Spanning Tree.mp415.87MB

21. Graphs/2. Representation of Undirected Graph.mp443.32MB

21. Graphs/3. Representation of Directed Graphs.mp417.13MB

21. Graphs/4. Breadth First Search.mp452.93MB

21. Graphs/5. Program for BFS.mp425.74MB

21. Graphs/6. Depth First Search.mp430.68MB

21. Graphs/7. Program for DFS.mp411.23MB

21. Graphs/8. Let's Code BFS & DFS.mp415.85MB

21. Graphs/9. Spanning Trees.mp420.74MB

22. Asymptotic Notations/1. Asymptotic Notations Big Oh , Omega , Theta.mp432.97MB