Course Hive
Search

Welcome

Sign in or create your account

Continue with Google
or
Quick Sort Algorithm | Lecture-40 | C++ and DSA Foundation course
Play lesson

C++ and DSA Foundation Course - Quick Sort Algorithm | Lecture-40 | C++ and DSA Foundation course

5.0 (2)
54 learners

What you'll learn

This course includes

  • 85.5 hours of video
  • Certificate of completion
  • Access on mobile and TV

Summary

Keywords

Full Transcript

We hope that you are following the sorting lecture series regularly. In this series, today Urvi mam is going to cover another divide and conquer approach based sorting technique which is Quick sort. Quick sorting is a very important technique of sorting from a placement point of view or even for university internal examinations. So what are we waiting for ? See you in the class !! Are you finding the classes helpful? Stay tuned for more! Access the notes and assignments for this class for free at : ▶️https://pwskills.com/course/C++--Foundation PW Skills is announcing the launch of the following programs, Binary Batch:- Java-with-DSA-&-System-Design (Java with DSA & System Design) https://pwskills.com/course/Java-with-DSA-and-system-design (Hindi) https://pwskills.com/course/Java-with-DSA-and-System-Design (English) Sigma Batch:- Full-Stack-Web-Development (MERN Stack) https://pwskills.com/course/Full-Stack-web-development (Hindi) https://pwskills.com/course/Full-Stack-Web-Development (English) Impact Batch:- Data-Science-Masters (Full Stack Data Science) https://pwskills.com/course/Data-Science-masters (Hindi) https://pwskills.com/course/Data-Science-Masters (English) Website - https://pwskills.com/ Instagram - https://www.instagram.com/pwcollegewallah/ LinkedIn - https://www.linkedin.com/company/ineuron-ai https://www.linkedin.com/company/physicswallah/ Telegram - https://t.me/SkillsPW Discord - https://discord.gg/m7YSX6Xh Twitter - https://twitter.com/pw__skills TIME STAMPS: 00:00 - Introduction 00:58 - Recap 01:26 - Quicksort algorithm 16:20 - Choosing the pivot element 17:54 - Partition Algorithm 27:50 - Example 35:15 - Code 40:48 - Dry run 45:53 - Quicksort time and space complexity 54:21 - Need for new ways of partitioning and randomized Quicksort Algorithm 56:33 - Is quicksort stable? 57:04 - Application of Quicksort 57:57 - Merge sort vs Quick sort 59:25 - Summary #C++ #QuickSort #ProblemSolving #Lecture40 #Sorting #BasicProblems #DataStructures #CodingChallenges #Debugging #SortingAlgorithms #LogicalThinking #PWSkills #PhysicsWallah #CollegeWallah

Course Hive

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Related Courses

FAQs

Course Hive
Download CourseHive
Keep learning anywhere