Growth Comparison of Functions Explained | Notehub
Learn about growth comparison of functions and apply L'Hopital's Rule to determine orders of growth with examples and explanations
Abhijeet Singh Rajput
Collaborators
DAA (Design and Analysis)
25 Notes
Asymtotic Notation Explained: Big O, Omega, Theta | Notehub
Learn about asymtotic notation, Big O, Omega, and Theta. Understand how to categorize functions based on growth with examples and theorems
Abhijeet Singh Rajput
Algorithm Analysis: Growth Rate Comparison | Notehub
Understand algorithm analysis by comparing n², n log₂n, and 3ⁿ growth rates using asymptotic analysis and L’Hôpital’s Rule in DAA.
Abhijeet Singh Rajput
Algorithm: Learn Time & Space Complexity | Notehub
Discover algorithm basics, time complexity & space complexity. Learn how to measure performance with examples
Abhijeet Singh Rajput
Binary Search: Recurrence Relation Explained | Notehub
Learn about binary search recurrence relation, its equation and how it's used to find elements in an array efficiently with examples
Abhijeet Singh Rajput
Merge Sort Algorithm Explained with Recurrence Analysis
Explore Merge Sort, a divide and conquer algorithm that efficiently sorts arrays using merging, recursion, recurrence relations, and O(n log n) complexity.
Abhijeet Singh Rajput
Quick Sort Algorithm: with Worst, Best & Average Case
Quick Sort Algorithm: Divide and Conquer with Worst, Best & Average Case Analysis It is a popular sorting method based on the divide-and-conquer approa
Abhijeet Singh Rajput
Greedy Approach for Algorithm Design Techniques | Notehub
Learn about the greedy approach in algorithm design, its characteristics and applications in optimization problems like knapsack and spanning trees
Abhijeet Singh Rajput
Graph Data Structure: Types and Properties Explained
Learn about graph data structure, types of graphs and their properties, including connected graphs and spanning trees with graph
Abhijeet Singh Rajput
Floyd–Warshall Algorithm for All Pairs Shortest Path
Learn the Floyd–Warshall Algorithm for finding all pairs shortest paths with a worked example, matrices, recurrence, and O(n³) complexity.
Abhijeet Singh Rajput
Minimax Algorithm: Divide and Conquer Approach Explained
Learn how the minimax algorithm uses divide and conquer to make decisions in adversarial search, with a focus on time complexity and recurrence.
Abhijeet Singh Rajput
Permutation and Combination Explained - Notehub App
Learn permutation and combination concepts, formulas, and differences with examples and a recursive algorithm for generating permutations.
Abhijeet Singh Rajput
Binary Search Tree Basics Explained | Notehub Official
Learn about binary search tree properties and types, including balanced and skewed trees, with examples and explanations of search algorithms
Abhijeet Singh Rajput
Branch and Bound: Smarter Exhaustive Search | Notehub
Discover how the Branch and Bound technique accelerates algorithm speed and reduces state-space tree size for optimal solutions.
Abhijeet Singh Rajput
Tower of Hanoi: Recursive Problem Solution | Notehub
Learn the tower of hanoi problem and its recursive solution with example moves and time complexity analysis for optimal understanding
Abhijeet Singh Rajput
GCD: Calculate Greatest Common Divisor Easily Online
Learn how to find gcd of two numbers and simplify fractions with our guide on greatest common divisor calculation methods
Abhijeet Singh Rajput
fractional Knapsack Problem Explained, with Solved Example
Fractional Knapsack Problem: Greedy Algorithm with Solved Example In the fractional knapsack problem , we have items of known values and weights, and a kna
Abhijeet Singh Rajput
Dynamic Programming: 0/1 Knapsack Problem Solved | Notehub
Learn dynamic programming to solve 0/1 knapsack problem with optimal subset selection and capacity constraints for maximum profit
Abhijeet Singh Rajput
Minimum Spanning Tree : Kruskal's & Prim's Algorithm
(MST) Kruskal’s & Prim's Algorithm Kruskal’s and Prim’s algorithms are two fundamental greedy approaches used to find a Minimum Spanning Tree (MST) of
Abhijeet Singh Rajput
Dijkstra's Algorithm: Shortest Path Finder Explained
Learn Dijkstra's algorithm to find shortest paths in weighted graphs with non-negative edge weights, used in GPS and network routing
Abhijeet Singh Rajput
Job Scheduling: Why Greedy Works (And When It Fails)
Learn how to optimize job scheduling to maximize profit within deadlines. Discover effective strategies and techniques for job scheduling.
Abhijeet Singh Rajput
BFS/DFS Algorithms Explained in Detail Here | Notehub
Learn bfs and dfs algorithms with examples and implementations to solve complex problems efficiently and effectively every time
Abhijeet Singh Rajput
OBST: Optimal Binary Search Tree Technique Explained
Learn about Optimal Binary Search Tree (OBST) technique, a dynamic programming approach to minimize average search cost in binary search trees with given
Abhijeet Singh Rajput
Traveling Salesman Problem Solution Guide | Notehub
Learn about the traveling salesman problem, a classic problem in combinatorial optimization and operations research, with solutions
Abhijeet Singh Rajput
Solve Assignment Problem Easily With Branch | Notehub
Learn to solve assignment problem using branch and bound technique to minimize total assignment cost with given constraints
Abhijeet Singh Rajput