Sorting | Time and Space Analysis | Lecture 11 | C Programming
250.1 هزار بار بازدید -
2 سال پیش
-
Hello everyone!! In this video,
Hello everyone!! In this video, Raghav sir is going to teach you various sorting algorithms. Before introducing sorting algorithms he will explain the concept of time and space complexity analysis with a very simple example.
He will introduce the big O notation and will eventually solve many interesting questions of time and space complexity.
Also, he will be discussing the very famous 2-pointer approach which is very helpful in solving specific questions efficiently. He will explain bubble sort, insertion sort, selection sort algorithm with dry run on example and coding implementation.
After watching this video you are going to have a crystal clear idea of all the different algorithms of sorting and you will be able to predict which one is better to use in different situations.
For more such lecture videos don’t forget to like, share and subscribe to collegewallah channel.
Access the notes and assignments for this class for free at : ▶️http://bit.ly/3x4FjJ9
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... (Hindi)
https://pwskills.com/course/Java-with... (English)
Sigma Batch:- Full-Stack-Web-Development (MERN Stack)
https://pwskills.com/course/Full-Stac... (Hindi)
https://pwskills.com/course/Full-Stac... (English)
Impact Batch:- Data-Science-Masters (Full Stack Data Science)
https://pwskills.com/course/Data-Scie... (Hindi)
https://pwskills.com/course/Data-Scie... (English)
Website - https://pwskills.com/
Instagram - Instagram: pwcollegewallah
LinkedIn - LinkedIn: ineuron-ai
LinkedIn: physicswallah
Telegram - https://t.me/SkillsPW
Discord - Discord: discord
Twitter - Twitter: pw__skills
TIME STAMPS:
00:00 Introduction
01:51 - Today’s checklist
02:14 - understanding time and space complexity through a question.
04:40 - First method(brute force) approach discussion
12:38 - Second method (optimized) approach discussion
20:50 - Most optimized approach discussion
29:32 - Time complexity in terms of big O notation
44:17 - Space complexity in terms of big O notation
47:52 - Question based on 2-pointer approach
1:06:02 - Bubble sort algorithm
1:42:44 Time complexity of bubble sort
1:49:47 Optimised bubble sort using flag
2:08:14 Ques 3
2:08:56 Ques 4
2:09:45 Selection Sort
2:41:29 Time Complexity of selection sort
2:52:46 Ques 5
2:53:18 Ques 6
2:55:00 Insertion Sort
3:18:50 Code for Insertion sort
3:35:17 Ques 7
3:35:38 Ques 8
3:36:29 Ques 9 : Move zeroes to end
3:47:08 Ques 10 : Move zeros to end in place
3:55:46 HW 1 : Return the kth smallest element
3:58:08 HW 2 : Form the smallest number
#CProgramming #Sorting #Bubblesort #Insertionsort #TimeandSpaceAnlysis #OneShotCCourse #CompleteCTutorial #CLecture11 #ProgrammingBasics #LearnCProgramming #OneShotCTutorial #PhysicsWallah #CollegeWallah #PWSkills
He will introduce the big O notation and will eventually solve many interesting questions of time and space complexity.
Also, he will be discussing the very famous 2-pointer approach which is very helpful in solving specific questions efficiently. He will explain bubble sort, insertion sort, selection sort algorithm with dry run on example and coding implementation.
After watching this video you are going to have a crystal clear idea of all the different algorithms of sorting and you will be able to predict which one is better to use in different situations.
For more such lecture videos don’t forget to like, share and subscribe to collegewallah channel.
Access the notes and assignments for this class for free at : ▶️http://bit.ly/3x4FjJ9
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... (Hindi)
https://pwskills.com/course/Java-with... (English)
Sigma Batch:- Full-Stack-Web-Development (MERN Stack)
https://pwskills.com/course/Full-Stac... (Hindi)
https://pwskills.com/course/Full-Stac... (English)
Impact Batch:- Data-Science-Masters (Full Stack Data Science)
https://pwskills.com/course/Data-Scie... (Hindi)
https://pwskills.com/course/Data-Scie... (English)
Website - https://pwskills.com/
Instagram - Instagram: pwcollegewallah
LinkedIn - LinkedIn: ineuron-ai
LinkedIn: physicswallah
Telegram - https://t.me/SkillsPW
Discord - Discord: discord
Twitter - Twitter: pw__skills
TIME STAMPS:
00:00 Introduction
01:51 - Today’s checklist
02:14 - understanding time and space complexity through a question.
04:40 - First method(brute force) approach discussion
12:38 - Second method (optimized) approach discussion
20:50 - Most optimized approach discussion
29:32 - Time complexity in terms of big O notation
44:17 - Space complexity in terms of big O notation
47:52 - Question based on 2-pointer approach
1:06:02 - Bubble sort algorithm
1:42:44 Time complexity of bubble sort
1:49:47 Optimised bubble sort using flag
2:08:14 Ques 3
2:08:56 Ques 4
2:09:45 Selection Sort
2:41:29 Time Complexity of selection sort
2:52:46 Ques 5
2:53:18 Ques 6
2:55:00 Insertion Sort
3:18:50 Code for Insertion sort
3:35:17 Ques 7
3:35:38 Ques 8
3:36:29 Ques 9 : Move zeroes to end
3:47:08 Ques 10 : Move zeros to end in place
3:55:46 HW 1 : Return the kth smallest element
3:58:08 HW 2 : Form the smallest number
#CProgramming #Sorting #Bubblesort #Insertionsort #TimeandSpaceAnlysis #OneShotCCourse #CompleteCTutorial #CLecture11 #ProgrammingBasics #LearnCProgramming #OneShotCTutorial #PhysicsWallah #CollegeWallah #PWSkills
2 سال پیش
در تاریخ 1401/11/20 منتشر شده
است.
250,118
بـار بازدید شده