Insertion Sort Algorithm: Theory & Code 📚

This is the third video in the sorting algorithm series where we cover insertion sort in depth. We look at how the algorithm works, the complexity analysis, optimisation, and code.

Take part in the learning in public initiative! Share your learnings on LinkedIn and Twitter with #DSAwithKunal & don't forget to tag us!

👉 Resources
- Join Replit: http://join.replit.com/kunal-kushwaha
- Complete Java DSA playlist: https://www.youtube.com/playlist?list=PL9gnSGHSqcnr_DxHsP7AW9ftq0AtAyYqJ
- Code, Assignments, & Notes: https://github.com/kunal-kushwaha/DSA-Bootcamp-Java

➡️ Connect with me: http://kunalkushwaha.com

=========================================
Timestamps:
0:00 Introduction
0:40 Insertion Sort
16:23 Complexity of Insertion Sort
16:43 Worst Case
19:07 Best Case
21:03 Why use Insertion Sort?
24:24 Code for Insertion Sort
30:18 Outro

#sorting #placement #dsa #interviews