2.1.3 Recurrence Relation (T(n)= T(n-1) + log n) #3

Lecture 21 of 49 in Data Structures by Abdul Bari. 12 min. Watch on YouTube

Course: Data Structures (Computer Science). Covers: data structures arrays linked lists stacks queues trees heaps hash tables graphs interview.

All lectures in Data Structures

  1. 1. Introduction to Algorithms · 12 min
  2. 1.1 Priori Analysis and Posteriori Testing · 2 min
  3. 1.2 Characteristics of Algorithm · 6 min
  4. 1.3 How Write and Analyze Algorithm · 11 min
  5. 1.4 Frequency Count Method · 12 min
  6. 1.5.1 Time Complexity #1 · 10 min
  7. 1.5.2 Time Complexity Example #2 · 14 min
  8. 1.5.3 Time Complexity of While and if #3 · 22 min
  9. 1.6 Classes of functions · 3 min
  10. 1.7 Compare Class of Functions · 5 min
  11. 1.8.1 Asymptotic Notations Big Oh - Omega - Theta #1 · 16 min
  12. 1.8.2 Asymptotic Notations - Big Oh - Omega - Theta #2 · 10 min
  13. 1.9 Properties of Asymptotic Notations · 12 min
  14. 1.10.1 Comparison of Functions #1 · 9 min
  15. 1.10.2 Comparison of Functions #2 · 10 min
  16. 1.11 Best Worst and Average Case Analysis · 19 min
  17. 1.12 Disjoint Sets Data Structure - Weighted Union and Collapsing Find · 26 min
  18. 2 Divide And Conquer · 7 min
  19. 2.1.1 Recurrence Relation (T(n)= T(n-1) + 1) #1 · 14 min
  20. 2.1.2 Recurrence Relation (T(n)= T(n-1) + n) #2 · 16 min
  21. 2.1.3 Recurrence Relation (T(n)= T(n-1) + log n) #3 · 12 min
  22. 2.1.4 Recurrence Relation T(n)=2 T(n-1)+1 #4 · 11 min
  23. 2.2 Masters Theorem Decreasing Function · 8 min
  24. 2.3.1 Recurrence Relation Dividing Function T(n)=T(n/2)+1 #1 · 9 min
  25. 2.3.2 Recurrence Relation Dividing [ T(n)=T(n/2)+ n]. #2 · 7 min
  26. 2.3.3 Recurrence Relation [ T(n)= 2T(n/2) +n] #3 · 11 min
  27. 2.4.1 Masters Theorem in Algorithms for Dividing Function #1 · 17 min
  28. 2.4.2 Examples for Master Theorem #2 · 6 min
  29. 2.5 Root function (Recurrence Relation) · 6 min
  30. 2.6.1 Binary Search Iterative Method · 20 min
  31. 2.6.2 Binary Search Recursive Method · 7 min
  32. 2.6.3 Heap - Heap Sort - Heapify - Priority Queues · 51 min
  33. 2.7.1 Two Way MergeSort - Iterative method · 20 min
  34. 2.7.2. Merge Sort Algorithm · 20 min
  35. 2.7.3 MergeSort in-depth Analysis · 13 min
  36. 2.8.1 QuickSort Algorithm · 14 min
  37. 2.8.2 QuickSort Analysis · 12 min
  38. 2.9 Strassens Matrix Multiplication · 24 min
  39. 3. Greedy Method - Introduction · 12 min
  40. 3.1 Knapsack Problem - Greedy Method · 16 min
  41. 3.2 Job Sequencing with Deadlines - Greedy Method · 13 min
  42. 3.3 Optimal Merge Pattern - Greedy Method · 10 min
  43. 3.4 Huffman Coding - Greedy Method · 18 min
  44. 3.5 Prims and Kruskals Algorithms - Greedy Method · 20 min
  45. 3.6 Dijkstra Algorithm - Single Source Shortest Path - Greedy Method · 19 min
  46. 4.1 MultiStage Graph - Dynamic Programming · 21 min
  47. 4.1.1 MultiStage Graph (Program) - Dynamic Programming · 14 min
  48. 4.2 All Pairs Shortest Path (Floyd-Warshall) - Dynamic Programming · 14 min
  49. 4.3 Matrix Chain Multiplication - Dynamic Programming · 23 min