Skip to content

[Log2base2] Algorithms (Reupload) (2020) [En]

Unverified source. This magnet is from an unverified source. The content may be unsafe or mislabeled. Proceed with caution.
Title: Algorithms ReuploadGroup: NOGRPYear: 2020
Info Hash
C5E74AA7749A1F44EA21AA9A61EA13CE6767C22B
Source
Unverified
Total Size
1.11 GB
Total Files
44
Seeders
0
Leechers
1
Health
Score
1
Type
Movie

File List

FileSize
26. Heapify.mp461.71 MB
2. How to write the algorithms.mp49.88 MB
3. How to analyse the algorithms.mp427.4 MB
4. Time and Space Complexity Analysis - Part 1.mp419.58 MB
5. Time and Space Complexity Analysis - Part 2.mp447.04 MB
6. Why analysing time complexity is important.mp48.47 MB
7. Binary Search - Implementation, Time & Space complexity.mp451.37 MB
8. Linear Search - Implementation, Time & Space complexity.mp422.98 MB
9. Introduction to hashing and collision.mp430.54 MB
10. Collision avoidance using linear probing.mp422.95 MB
11. Implement hash table with linear probing - Insert.mp429.17 MB
12. Implement hash table with linear probing - Delete.mp413.79 MB
13. Implement hash table with linear probing - Search.mp49.62 MB
14. Quadratic Probing.mp46.3 MB
15. Open Hashing or Separate Chaining.mp448.23 MB
16. Introduction to selection sort.mp429.61 MB
17. Selection sort.mp421.01 MB
18. Selection sort time and space complexity.mp417.47 MB
19. Introduction to bubble sort.mp458 MB
20. Bubble sort.mp433.64 MB
21. Bubble sort time and space complexity.mp420.49 MB
22. Introduction to insertion sort.mp428.12 MB
23. Insertion sort.mp418.04 MB
24. Insertion sort time and space complexity.mp421.52 MB
25. Introduction to Binary Heap.mp416.51 MB
1. Introduction to Algorithms.mp428.59 MB
27. Quick Sort Introduction.mp443.4 MB
28. Implementation of Partion function - Quick Sort.mp48.29 MB
29. Merge Sort I.mp410.79 MB
30. Merge Sort II.mp454.98 MB
31. Heap Sort.mp422.71 MB
32. Introduction to Divide and Conquer Strategy.mp430.77 MB
33. Binary Search using Divide and Conquer Strategy.mp425.43 MB
34. What is an optimization problem How to solve it.mp410.22 MB
35. Introduction to Dynamic Programming.mp419.07 MB
36. Memoization Avoid Recomputation Issue in Top-Down Approach.mp49.66 MB
37. Implementation of Nth Fibonacci Bottom-Up approach.mp49.86 MB
38. Implementation of Nth Fibonacci To-Down Approach with Memoization.mp435.07 MB
39. Introduction to Greedy Algorithms.mp48.41 MB
40. Minimum Coin Exchange Problem.mp424.16 MB
41. Greedy can be Wrong Yes!.mp411.17 MB
42. Implementation of Minimum Coin Exchange Problem.mp419.81 MB
43. Breadth First Search(BFS).mp444.94 MB
44. Depth First Search (DFS).mp443.42 MB

Trackers

No trackers found.