Intro to Sorting and Divide & Conquer Algorithms in Python | Free Webinar

⚡ A beginner-friendly introduction to sorting techniques like Bubble Sort, Insertion Sort, Merge Sort, Quicksort and Divide & Conquer. Join us as we explore the sorting problem and apply the divide-and-conquer strategy to come up with efficient algorithms for sorting.

Notebooks used in the workshop:

The problem of sorting a list of objects comes up over and over in computer science and software development, and it's important to understand common approaches for sorting and the trade-offs they offer.

Topics covered:
✅ Bubble Sort - a sorting algorithm that works by repeatedly swapping adjacent elements
✅ Insertion Sort - a sorting algorithm that builds the final sorted array one item at a time
✅ Merge Sort - a sorting algorithm that works by recursively sorting two halves of the array and merging them
✅ Quick Sort - an algorithm based on partitioning of the array into smaller arrays that can be sorted independently
✅ Divide & Conquer - a recursive strategy to break down a problem until it is simple enough to be solved and combine the results

👨‍🏫 Instructor: Aakash N S is the co-founder and CEO of Jovian. Previously, Aakash has worked as a software engineer (APIs & Data Platforms) at Twitter in Ireland & San Francisco and graduated from the Indian Institute of Technology, Bombay. He’s also an avid blogger, open-source contributor, and online educator.

-