Easy way to learn DAA

Basics of Algorithms
DAA - Introduction
DAA - Analysis of Algorithms
DAA - Methodology of Analysis
Asymptotic Notations & Apriori Analysis
DAA - Space Complexities
Design Strategies
DAA - Divide & Conquer
DAA - Max-Min Problem
DAA - Merge Sort
DAA - Binary Search
Strassen’s Matrix Multiplication
DAA - Greedy Method
DAA - Fractional Knapsack
DAA - Job Sequencing with Deadline
DAA - Optimal Merge Pattern
DAA - Dynamic Programming
DAA - 0-1 Knapsack
Longest Common Subsequence
Graph Theory
DAA - Spanning Tree
DAA - Shortest Paths
DAA - Multistage Graph
Travelling Salesman Problem
Optimal Cost Binary Search Trees
Heap Algorithms
DAA - Binary Heap
DAA - Insert Method
DAA - Heapify Method
DAA - Extract Method
Sorting Methods
DAA - Bubble Sort
DAA - Insertion Sort
DAA - Selection Sort
DAA - Quick Sort
DAA - Radix Sort
Complexity Theory
Deterministic vs. Nondeterministic Computations
DAA - Max Cliques
DAA - Vertex Cover
DAA - P and NP Class
DAA - Cook’s Theorem
NP Hard & NP-Complete Classes
DAA - Hill Climbing Algorithm