Lesson 3 - Sorting Algorithms and Divide & Conquer

Data Structures and Algorithms in Python

← Back

Course Home

Lesson 1 - Binary Search, Linked Lists and Complexity Assignment 1 - Binary Search Practice Lesson 2 - Binary Search Trees, Traversals and Recursion Assignment 2 - Hash Tables and Python Dictionaries

← Back

Course Home

Assignment 3 - Divide and Conquer Practice Lesson 4 - Recursion and Dynamic Programming Lesson 5 - Graph Algorithms (BFS, DFS & Shortest Paths)Project - Step-by-Step Solution to a Programming Problem Lesson 6 - Python Interview Questions, Tips & Advice

In this lesson, we explore the sorting problem and apply the divide-and-conquer strategy to come up with efficient algorithms for sorting. Notebooks used in this lesson:

Hindi Version: https://youtu.be/W0R6m1sX1sY

Sorting and Divide & Conquer: https://jovian.ai/aakashns/python-sorting-divide-and-conquer
Problem Solving Template: https://jovian.ai/aakashns/python-problem-solving-template

Ask questions and get help on the course community forum.

Notebooks

Your Notebooks

aakashns/python-sorting-divide-and-conquer

Code it Yourself

aakashns/python-problem-solving-template

Code it Yourself