Learn Algorithms : Video Tutorials

Meilleur didacticiel vidéo sur les algorithmes pour les débutants

★ Table of Contents ★

1) Introduction

2) Priori Analysis and Posteriori Testing

3) Characteristics of Algorithm

4) How Write and Analyze Algorithm

5) Frequency Count Method

6) Time Complexity-Part 1

7) Time Complexity-Part 2

8) Time Complexity-Part 3

9) Classes of functions

10) Compare Class of Functions

11) Asymptotic Notations-Part 1

12) Asymptotic Notations-Part 2

13) Properties of Asymptotic Notations

14) Comparison of Functions-Part 1

15) Comparison of Functions-Part 2

16) Best Worst and Average Case Analysis

17) Disjoint Sets Data Structure

18) Divide And Conquer

19) Recurrence Relation-Part 1

20) Recurrence Relation-Part 2

21) Recurrence Relation-Part 3

22) Recurrence Relation-Part 4

23) Masters Theorem Decreasing Function

24) Recurrence Relation Dividing Function-Part 1

25) Recurrence Relation Dividing Function-Part 2

26) Recurrence Relation Dividing Function-Part 3

27) Masters Theorem-Part 1

28) Masters Theorem-Part 2

29) Root function (Recurrence Relation)

30) Binary Search Iterative Method

31) Binary Search Recursive Method

32) Two Way MergeSort - Iterative method

33) Merge Sort Algorithm

34) MergeSort in-depth Analysis

35) QuickSort Algorithm

36) QuickSort Analysis

37) Strassens Matrix Multiplication

38) Greedy Method - Introduction

39) Knapsack Problem - Greedy Method

40) Job Sequencing with Deadlines

41) Optimal Merge Pattern

42) Huffman Coding

43) Prims and Kruskals Algorithms

44) Dijkstra Algorithm

45) Principle of Optimality

46) MultiStage Graph-Part 1

47) MultiStage Graph-Part 2

48) All Pairs Shortest Path

49) Matrix Chain Multiplication-Part 1

50) Matrix Chain Multiplication-Part 2

51) Bellman Ford Algorithm

52) Knapsack-Part 1

53) Knapsack Problem-Part 2

54) Optimal Binary Search Tree

55) Traveling Salesman Problem

56) Reliability Design

57) Longest Common Subsequence (LCS)

58) Graph Traversals - BFS & DFS

59) Articulation Point and Biconnected Components

60) Introduction to Backtracking

61) N Queens Problem using Backtracking

62) Sum Of Subsets Problem - Backtracking

63) Graph Coloring Problem - Backtracking

64) Hamiltonian Cycle - Backtracking

65) Branch and Bound Introduction

66) Job Sequencing with Deadline

67) Knapsack using Branch and Bound

68) Traveling Salesman Problem

69) NP-Hard and NP-Complete Problems

70) NP-Hard Graph Problem

71) Knuth-Morris-Pratt KMP String

72) Rabin-Karp String Matching Algorithm

73) AVL Tree - Insertion and Rotations

74) B Trees and B+ Trees

75) Asymptotic Notations

76) Hashing Technique

77) Shortest Path Algorithms

78) BFS DFS - Simplified

79) Tower of Hanoi Problem - Made Easy

80) Row-Major and Column-Major Mapping

81) Merge Sort Algorithm - Hindi

-------------------------------------------------------

Disclaimer : Developer claims no credit for any video embedded in this app unless otherwise noted. Videos embedded in this app are copyright to its respectful owners. If there is an video appearing in this app that belongs to you and you do not want it to appear in this app, please contact us via email and it will be promptly removed.