Section outline

    • Topics of discussion

      1. Introduction to Divide and Conquer Approach.
      2.  Introduction to the searching Algorithm based on Divide and Conquer Approach. 
      3. Introduction to the Sorting Algorithm based on Divide and Conquer Approach. 

      Expected Learning Outcome

      1. Knowledge about the Binary Search algorithm and its complexity
      2. Knowledge about the Merge sort algorithm and its complexity
      3. Knowledge about the Quicksort algorithm and its complexity
      4. Exercise the Sorting and searching Algorithm with some additional problems.


      Week-04 Plan
      week planTopicsMaterials
       Week-04 Lecture-01                                  
      • Video on Lecture 
      • PPT on Lecture


      Binary Search
      Merge Sort
      Divide and Conquer Approach                    

      Video Link
      PPT link

      Week-04 Lecture-02
      • Video on Lecture 
      • PPT on Lecture

      Quick Sort

      Video Link
      PPT link

       Week-04 Lab
      • Video on Lab
      • Manual on Lab


      Bubble Sort
      Insertion Sort
      Binary Search

       Video Link  
      Manual Link


      Quick Sort video





      Class Lecture of 29.06.2020:  

      Click here