Section outline

  • LESSON OBJECTIVE

    • To teach the main strategy of divide & conquer and the examples/ problems those are typically solved by this strategy and the complexity analysis of those problems

    LEARNING OUTCOMES

    • Explain how divide & conquer strategy works
    • Give examples of problems those are typically solved using divide & conquer strategy
    • Explain the complexity of the problems those are typically solved using divide & conquer strategy
    • Draw difference in complexity between brute force and divide & conquer

    TOPICS

    • Basic understanding of divide & conquer
    • Binary search & its complexity
    • Merge sort and its complexity analysis
    • Quick sort and its complexity analysis

    CONTENTS