Lecture16: Selection Sort [Theory + Code] || C++ Placement Series

In this Video, we are going to learn about What is Selection sort, approach, Time & Space Complexity, Best & worst case, DryRun, etc.

There is a lot to learn, Keep in mind “ Mnn boot karega k chor yrr apne se nahi yoga ya maza nahi para, Just ask 1 question “ Why I started ? “

Visit Coding Ninjas: https://bit.ly/3cfdKTe

Discord Server Link:   / discord  

Course Flow: https://whimsical.com/dsa-4-placement...

Homework: Added in Video already [25:33]

Notes Link: https://drive.google.com/file/d/1WtwE...

Code Links: https://github.com/loveBabbar/CodeHel...

Question Links:
Selection Sort: https://bit.ly/3DrsGsv

Do provide you feedback in the comments, we are going to make it best collectively.

Telegram Group Link: Love Babbar CODE HELP
https://telegram.me/lovebabbercodehelp

Connect with me here:

Instagram:   / lovebabbar1  
Twitter:   / lovebabbar3  


Intro Sequence: We have bought all the required Licenses of the Audio, Video & Animation used.

Timestamps:

00:00 - Introduction
00:40 - What is Sorting ?
02:35 - Promotion
03:38 - What is Selection Sort ?
09:35 - Code
13:56 - Example 1
15:23 - Example 2
17:23 - Example 3
18:44 - Example 4
20:33 - Space Complexity
21:28 - Time Complexity
22:41 - Best case & worst case time Complexity
23:51 - Use case
25:33 - Homework
27:15 - Bye Bye
27:50 - One more Dry Run


#DSABusted #LoveBabbar