Complete C++ Placement DSA Course - Lecture 17: BUBBLE SORT in 1 Video [Theory + Optimised Code] || Best/Worst Case Complexity

In this Video, we are going to learn about What is Bubble 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/31zFssd Discord Server Link: https://discord.gg/feSQvVXMrd Course Flow: https://whimsical.com/dsa-4-placement-by-love-babbar-C7JX2fJ8hprv9ivEHkArjD@2Ux7TurymNF9zkFahVLk Homework: Added in Video already [] Notes Link: https://drive.google.com/file/d/1DScaSvG0TzAy2b9MF9CcEtzoOxvai3MY/view?usp=sharing Code Links: https://github.com/loveBabbar/CodeHelp-DSA-Busted-Series Question Links: - Bubble Sort: https://bit.ly/3pvCTz9 - GFG Quiz: https://www.geeksforgeeks.org/quiz-bubblesort-gq/ 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: https://www.instagram.com/lovebabbar1/ Twitter: https://twitter.com/lovebabbar3 Intro Sequence: We have bought all the required Licenses of the Audio, Video & Animation used. Timestamps: 00:00 - Introduction 00:43 - What is Sorting ? 01:18 - What is Bubble Sort ? 05:47 - Promotion 06:50 - Bubble Sort 13:47 - Use Case 14:22 - Code 20:27 - Homework 21:30 - One more Example 25:33 - Time Complexity 26:46 - Space Complexity 27:09 - Optimisation 28:39 - Optimised Code 29:53 - Best and Worst Case Time Complexity 30:17 - Homework #DSABusted #LoveBabbar