Insertion Sort | Sorting Algorithm

In this video, I have explained insertion sort.
Insertion Sort is a simple sorting algorithm that builds the final sorted list one item at a time.
The list is virtually split into a sorted and an unsorted part. Values from the unsorted part are picked and placed at the correct position in the sorted part.
When humans manually sort something (for example, a deck of playing cards), most use a method that is similar to insertion sort.

https://github.com/fit-coder/fitcoderyoutube/tree/master/sorting

00:00 Introduction
00:06 Insertion Sort
03:59 Pseudo Code
13:55 Insertion Sort properties
16:13 C++ Implementation

-------------------------------------------------------------
I live in New Delhi and love explaining programming concepts. I have done M.Tech(BITS Pilani) + B.Tech(PEC, Chandigarh) in Computer Science and am currently working as a software engineer in a MNC.
If you like my content, please like, share my videos and subscribe to the channel.
-------------------------------------------------------------

For Sorting Algorithms, please refer to the below playlist:
https://www.youtube.com/playlist?list=PLFj4kIJmwGu08Rq9e-ensRK5bFA2fVUhz

For Linked List tutorials, please refer to the below playlist:
https://youtube.com/playlist?list=PLFj4kIJmwGu1oI1HVzAZlpJgKf9xv6mM1

For Binary tree tutorials, please refer to the below playlist:
https://youtube.com/playlist?list=PLFj4kIJmwGu2VDN0qKVMmCbEeGBEpXzkX

For Binary search tree tutorials, please refer to the below playlist:
https://youtube.com/playlist?list=PLFj4kIJmwGu21Tv1mmsNFOf5pWUrSjr55

For in-depth Graph theory and implementation details, please refer to the below playlist:
https://youtube.com/playlist?list=PLFj4kIJmwGu0yzwN3qZmw6p3E3zpoHpZz

#DataStructure #sorting #FitCoder #Algorithm #competitiveprogramming #faang #codinginterview