Structure & Algorithms tutorial

  • WatchAlgorithms Lecture 1 -- Introduction to asymptotic notations
  • WatchAlgorithms lecture 2 -- Time complexity Analysis of iterative programs
  • WatchAlgorithms lecture 3 -- Time analysis of recursive program
  • WatchAlgorithms lecture 4 -- comparing various functions to analyse time complexity
  • WatchAlgorithms lecture 5 -- Masters theorem
  • WatchAlgorithms lecture 6 -- Analysing Space complexity of iterative and recursive algorithms
  • WatchAlgorithms Lecture 7 -- Insertion sort algorithm and analysis
  • WatchAlgorithm lecture 8 -- Merge sort algorithm, analysis and problems
  • WatchAlgorithms lecture 9 -- Quick sort algorithm
  • WatchAlgorithms lecture 10 -- Analysis of quick sort and problems on it
  • WatchAlgorithms lecture 11 -- introduction to heaps
  • WatchAlgorithms lecture 12 -- Max heapify algorithm and complete binary tree
  • WatchAlgorithms lecture 13-- Build max heap algorithm and analysis
  • WatchAlgorithms lecture 14-- Extract max, increase key and insert key into heap
  • WatchAbout the lectures

Data Structures and Algorithms from University of California, San Diego, National Research University Higher School of Economics. This specialization is a mix of theory and practice: you will learn algorithmic techniques for solving various …

You may also like...