कुछ चीजें होती है जिनका बखान किया जाएं तो शायद शब्द कम पड़ जाए। उनमें से ही एक है आपका यह अविश्वसनीय प्रयास । बहुत बहुत आभार आपका जो आपने इतनी अच्छी कोर्स बनाई आपने। 🙏💗💕
Sir, the content provided by you is excellent. I want you to teach us the topic - File I/O as it will come in my upcoming end sem. Thanks in advance :)
49:51 there is difference b/w non-decreasing and increasing , increasing means increasing order without repetition but non decreasing means values can repeat(right next to previous value) or increase but can't decrease eg:- 1,2,2,3,4,5,6,6,7 eg of increasing :- 1,2,3,4,5,6,7😇😇 rest all is great😇
Sirrrrr please teach algorithms toooo bcz of these lectures Iam able to do well in coding exams in clg Ur lectures are very productive please continue this series
Hi sir very nice video and I think that you are the best teacher for coding in C language on youtube and making some other videos on important topics which are asked in the semester exam ❤️❤️❤️
Thankyou sir for these all topic of c programming language complete on this day apka again thankyou sir hrr video me maza aa gya sir , I will not stand this place without your videoes but today i will memorise some important knowledge with your videoes.....
00:08 Today's lecture focuses on sorting algorithms in C language. 02:08 Understanding time and space complexity 07:57 Understanding nested loop situations and their impact on operations 11:36 Time complexity analysis of element comparison 17:14 Efficiency in time and space usage is crucial for code optimization. 20:24 Finding the duplicate element using mathematical approach. 25:35 Understanding time and space complexity in coding 28:00 Understanding time and space complexity in code optimization. 32:36 Understanding time complexity and the impact of constants on it. 35:03 Discussion on time complexity of the code 41:39 Understanding time complexity of code operations. 44:10 Discussion on extra space complexity in relation to the size of N 49:12 Understanding ascending and descending order in sorting. 51:50 Discussion on time complexity and space complexity of sorting algorithms 58:48 Explanation of sorting algorithm and comparison of elements 1:02:20 Introduction to pointers and array indexing. 1:07:20 Explanation of bubble sort algorithm 1:10:17 Sorting elements based on comparisons 1:14:38 Sorting using swapping method 1:17:20 Explaining the technique of swapping elements in C programming 1:21:28 Bubble sort algorithm explained 1:24:03 Bubble sort algorithm and passing elements 1:29:39 Discussing the implementation of sorting algorithms in C programming. 1:33:30 Discussing the sorting algorithm in C programming 1:39:25 Understanding the inner and outer loops in bubble sort 1:41:27 Understanding the time complexity of Bubble Sort 1:45:57 Time complexity of Bubble Sort is O(n^2) 1:48:23 Worst case occurs in descending order, impacting number of operations and swaps. 1:54:04 Optimized code reduces the number of passes. 1:56:21 Optimizing the Bubble Sort algorithm to reduce time complexity. 2:01:22 Time complexity of sorting in C programming 2:03:45 Understanding time and space complexity in sorting algorithm 2:08:15 Explaining time and space complexity of Bubble Sort 2:10:11 Understanding bubble sort and implementing sorting algorithms in C programming. 2:14:34 Sorting using minimum element 2:16:27 Understanding the process of sorting and time and space analysis in C programming. 2:20:46 Sorting algorithms like Selection Sort explained 2:22:53 Discussion on the number of passes in bubble sort 2:28:03 Sorting requires finding the minimum element and replacing it in each pass. 2:30:27 Understanding the process of finding the minimum element in sorting algorithms. 2:34:24 Explaining the selection sort algorithm 2:38:04 Understanding the process of sorting in C programming 2:42:00 Bubble sort time complexity 2:43:56 Time and Space Analysis for Sorting 2:48:18 Sorting and analyzing the position of elements after sorting 2:50:33 The smallest element is found and replaced 2:55:04 Comparison of sorting algorithms and insertion sort 2:57:13 The process of sorting explained using the analogy of an assembly line. 3:01:16 Understanding the swapping and sorting technique. 3:03:36 Understanding the process of sorting and inserting elements 3:07:49 Explanation of bubble sort algorithm and application in C programming. 3:10:19 Discussion on sorting and comparison of elements 3:14:50 Understanding when swapping occurs 3:17:39 Time and space analysis of sorting algorithms 3:22:16 Demonstration of element swapping and insertion in C programming 3:25:40 Understanding the iteration and swapping process in sorting 3:32:28 Comparing and sorting elements 3:34:26 Maintaining relative order in insertion sort with stable sorting 3:38:42 Implementing a reduction algorithm to sort the elements. 3:41:21 Maintaining index and handling zero elements in the array. 3:47:08 Understanding and implementing the bubble sort algorithm. 3:50:22 Understanding bubble sort and zero comparison 3:56:57 Explanation of bubble sort and selection sort algorithms 3:59:14 Converting digits to numbers using minimum and second minimum digit 4:04:21 Learning C++ for placement and enjoying the learning process. Crafted by Merlin AI.
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
Man what a video this is am regretting not watching this before my first CodeChef contest, I solved 3 questions and the about to solve the 4th one but I failed its last test case which gave me a Time complexity exceed error. If I watched this video am able to solve 4 questions. :)
Maine aapki c program ki sari vidio dekh liya bahut acha tha maza aa jata hai aapse padhke but mai chahunga ki apne 3- 4 ghante wale vidios me kuch hasane wale bat kare taki student ko stress na ❤❤❤ mai aapke or bhi language aapse padhna chahunga
Sir 22:49 user tho koi bhi random number daal sakta hai n times yeeh tho jarori hai nhi ki voo ek given range for eg. 1-10 ki hi values dale!! Random numbers ke liye tho yeeh fail ho jayega!
Pleaseeeeeeeee sir make videos on dynamic memory allocation and file handling 🙏🏻🙏🏻🙏🏻 its a request and thank you very much for the wondefuL previous lectures
Sir Jo coding karte he ap us ko hum kese likhy yhe Jo itni sari logical Nishani he for example hum ko j< n-1 likhna he kese pata Chali ab yhe karna he ab yhe karna he dhere dhere is me confusion Hoti he so please help me
📗 Enroll Now in Decode Batches and become JOB READY:
📌 Python with DSA: bit.ly/4bXv5xF
📌 Java with DSA: bit.ly/49vEQkZ
📌 C++ with DSA: bit.ly/49NnNKT
I studied 11th , 12th from physics wallah , now sir you are helping me to continue my streak of studying from pw even in college
Thanks to you sir
welcome beta :)
@@subhamsingh7627 😆
कुछ चीजें होती है जिनका बखान किया जाएं तो शायद शब्द कम पड़ जाए।
उनमें से ही एक है आपका यह अविश्वसनीय प्रयास ।
बहुत बहुत आभार आपका जो आपने इतनी अच्छी कोर्स बनाई आपने।
🙏💗💕
Kya bat khi hai apnee❤❤
Sir, the content provided by you is excellent. I want you to teach us the topic - File I/O as it will come in my upcoming end sem. Thanks in advance :)
2:11:30
We have to change the condition inside 'if' from if(arr[y]>arr[y+1]) to if(arr[y+1]>arr[y])
Yes sir we want file handling and dynamic memory allocation
Yes sir we want that lecture
Its important sir
abe dp change kar bhootni
@@mrcow6531 🤣🤣🤣🤣
OYE BHOOTNI DP CHANGEKR
Yes sir we really need tutorials on file handling , and it's funcns and dynamic memory allocation
at 2:00:53 sir best way is
if array is sorted then
loop lga kar reverse kar do.
or yeh everytime true hogi
for ascending and decending both
49:51 there is difference b/w non-decreasing and increasing , increasing means increasing order without repetition but non decreasing means values can repeat(right next to previous value) or increase but can't decrease eg:- 1,2,2,3,4,5,6,6,7 eg of increasing :- 1,2,3,4,5,6,7😇😇 rest all is great😇
We need File Handling sir. I don't wanna study C with any other teacher bcoz you are awesome.
1:57:33 Sir Yeha Pe Apne
Bool Flag = false; Rakha Hai
Condition Ke Andar V false Hai
To Phir Loop Ke Bahar
If(flag==true) Kaise Hoga
Samaj Nhi Aya Sir
😅 how it is possible
it must be initialized with bool flag = true ;
sir had certainly made a mistake here
sir ne change kiya vo baad mein
Who want that All Video On Data structures will be upload In This Channel in c ?like here
Thanku sir for providing such good c programming series I liked ur video most Sir now start PYTHON SERIES ASAP PLEASE PLEASE 🙃
Sirrrrr please teach algorithms toooo bcz of these lectures Iam able to do well in coding exams in clg
Ur lectures are very productive please continue this series
Thank you bhaiya for C language...please bring python also because it is in the O level syllabus of nielit. It would be of great help.
Nielit kya hai?
Hi sir very nice video and I think that you are the best teacher for coding in C language on youtube and making some other videos on important topics which are asked in the semester exam ❤️❤️❤️
[12].I have seen this lecture today. And you explain any concept in easy language, sir.
9th November 2023
❤❤❤❤❤
Thankyou sir for these all topic of c programming language complete on this day apka again thankyou sir hrr video me maza aa gya sir , I will not stand this place without your videoes but today i will memorise some important knowledge with your videoes.....
Finally i completed this Playlist..thank you so much .. really it help me alot.. very very useful and informative❤😊🙏
sir, for descending order we just need to change the greater than sign to smaller than
00:08 Today's lecture focuses on sorting algorithms in C language.
02:08 Understanding time and space complexity
07:57 Understanding nested loop situations and their impact on operations
11:36 Time complexity analysis of element comparison
17:14 Efficiency in time and space usage is crucial for code optimization.
20:24 Finding the duplicate element using mathematical approach.
25:35 Understanding time and space complexity in coding
28:00 Understanding time and space complexity in code optimization.
32:36 Understanding time complexity and the impact of constants on it.
35:03 Discussion on time complexity of the code
41:39 Understanding time complexity of code operations.
44:10 Discussion on extra space complexity in relation to the size of N
49:12 Understanding ascending and descending order in sorting.
51:50 Discussion on time complexity and space complexity of sorting algorithms
58:48 Explanation of sorting algorithm and comparison of elements
1:02:20 Introduction to pointers and array indexing.
1:07:20 Explanation of bubble sort algorithm
1:10:17 Sorting elements based on comparisons
1:14:38 Sorting using swapping method
1:17:20 Explaining the technique of swapping elements in C programming
1:21:28 Bubble sort algorithm explained
1:24:03 Bubble sort algorithm and passing elements
1:29:39 Discussing the implementation of sorting algorithms in C programming.
1:33:30 Discussing the sorting algorithm in C programming
1:39:25 Understanding the inner and outer loops in bubble sort
1:41:27 Understanding the time complexity of Bubble Sort
1:45:57 Time complexity of Bubble Sort is O(n^2)
1:48:23 Worst case occurs in descending order, impacting number of operations and swaps.
1:54:04 Optimized code reduces the number of passes.
1:56:21 Optimizing the Bubble Sort algorithm to reduce time complexity.
2:01:22 Time complexity of sorting in C programming
2:03:45 Understanding time and space complexity in sorting algorithm
2:08:15 Explaining time and space complexity of Bubble Sort
2:10:11 Understanding bubble sort and implementing sorting algorithms in C programming.
2:14:34 Sorting using minimum element
2:16:27 Understanding the process of sorting and time and space analysis in C programming.
2:20:46 Sorting algorithms like Selection Sort explained
2:22:53 Discussion on the number of passes in bubble sort
2:28:03 Sorting requires finding the minimum element and replacing it in each pass.
2:30:27 Understanding the process of finding the minimum element in sorting algorithms.
2:34:24 Explaining the selection sort algorithm
2:38:04 Understanding the process of sorting in C programming
2:42:00 Bubble sort time complexity
2:43:56 Time and Space Analysis for Sorting
2:48:18 Sorting and analyzing the position of elements after sorting
2:50:33 The smallest element is found and replaced
2:55:04 Comparison of sorting algorithms and insertion sort
2:57:13 The process of sorting explained using the analogy of an assembly line.
3:01:16 Understanding the swapping and sorting technique.
3:03:36 Understanding the process of sorting and inserting elements
3:07:49 Explanation of bubble sort algorithm and application in C programming.
3:10:19 Discussion on sorting and comparison of elements
3:14:50 Understanding when swapping occurs
3:17:39 Time and space analysis of sorting algorithms
3:22:16 Demonstration of element swapping and insertion in C programming
3:25:40 Understanding the iteration and swapping process in sorting
3:32:28 Comparing and sorting elements
3:34:26 Maintaining relative order in insertion sort with stable sorting
3:38:42 Implementing a reduction algorithm to sort the elements.
3:41:21 Maintaining index and handling zero elements in the array.
3:47:08 Understanding and implementing the bubble sort algorithm.
3:50:22 Understanding bubble sort and zero comparison
3:56:57 Explanation of bubble sort and selection sort algorithms
3:59:14 Converting digits to numbers using minimum and second minimum digit
4:04:21 Learning C++ for placement and enjoying the learning process.
Crafted by Merlin AI.
Thank you so much sir❤ only following your videos I completed till this point,, almost total c programming completed thank you Sir❤😊😊
Yes sir file handling ki video bhi chaiye
🙏🏻
Syllabus mee hai
Thank you sir,
Yes, we need File handling video.
Your teaching method is too good please upload more lecture
Sir Thanks for teaching us in one of the best way on the earth 🥳🥳🥳🥳
🙏🙏🙏❤️❤️❤️
best explanation on youtube no comparison of this video
We'll know the worth of this man after moving ahead of C
Yeah brother 😢
Such a nice explanation on bubble sort ❤
Really found the content which I don't get it anywhere......❤
Yes sir, we need dynamic memory allocation and file handling.
Mazzza ayaa sir🙏🙏🙏🙏🙏🎉
Infinity thanks for your support sir ❣️❣️👌🙏
Yes ,sir we wants file handling series also
(2:11:36) HW: Descending order is just change , if(arr[j] < arr[j+1] ) then all are same ....👍👍
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
Sir aapki video se hme bht bht help milti hai
sir file handling and searching v karwa do college exam mein pucha jaega
and thanku for wonderful videos👌👌👌👌
We want lecture on file handling and dynamic memory allocation plz 🙏 sir
Best teacher on whole UA-cam❤
sir file handling is in our syallubus.......pls make video of that also.......thanku........
Man what a video this is am regretting not watching this before my first CodeChef contest, I solved 3 questions and the about to solve the 4th one but I failed its last test case which gave me a Time complexity exceed error. If I watched this video am able to solve 4 questions. :)
Thank you so much sir ❤❤❤🙏🙏🙏👏👏
Maza aa gaya 🎉🎉🤩
Wonderful lec 👍👍
Thank you very very very much sir for this C programming series...I learned a lot from your lectures. ❤❤❤
It will be great effort if you make such a video on file handling and dynamic memory allocation in c programming. Thanks in advance. ❤
Sir please upload the video of file handling after 2 days we have our PUT
thanks sir ,c programming done
bhaiya pls do files i/o and finish the series with some nice questions on strings,funcs,pointers etc.....
bahut jyada mja aya sir thank you so much
Sir, I completed all lecture of C so sir plz try to upload next lecture as soon as possible
You are the best teacher
Sir, please make a video on Data structure in C
Sir itne easy se kon samjhata hai? Wo bhi insertion sort maine kitne videos dekhe, ab samajh aaya apke video se
2:11:22 the only change is if( n[ j ] < n[ j + 1 ])
Part 11 complete
Mja aa gya sir❤
Maine aapki c program ki sari vidio dekh liya bahut acha tha maza aa jata hai aapse padhke but mai chahunga ki apne 3- 4 ghante wale vidios me kuch hasane wale bat kare taki student ko stress na ❤❤❤ mai aapke or bhi language aapse padhna chahunga
Sir please cover File I/O also i don't understood even I am studying from IIT
Which iit
Sir please sir file handling concept is required for us sir ... And one shot detailed programs related to string etc sir
Thanks sir!, Maja Aa gaya, RADHA RADHA
sir please upload video for file handling and dynamic memory location
Sorting crystal clear😊 Enjoyed it ❤
Sir Maza as Gaya ❤
Thank you very much sir 🙏
Thank you sir❤
Maza aagya🎉
Sir plz post frequent videos on DSA in C language we need this very much 🤲
Bruhh Is this DS in C or C Programming????
Actually I'm New in Coding So I don't know about this all so please tell
@@samislost550 only c programming
END SEM hogyi boht badhiya gyi sir thanks
maza aagaaya sir . thank you .
Sir please next lecture on file handling or graphics sir please 🙏
Thank you very much sir ❤️❤️......we are blessed with your contents
❤ from odisha
Sir make video of file handling and dynamic memory allocation and preprocessor
Please upload DSA with Python
sir please make a video on file handling
Sir please make a video on file handling and dynamic allocation
Sir please we want you to teach us DSA... 🙏🏻🙏🏻
Maja aa gya sir . thank you !❤
Thank you sir itne dino ke bad ajj video upload Kiya app kya bat hai
Easy peasy 😊
Please make a video on file handling....
Yes sir we need it
best series ever please teach dsa also
maza aa gaya sir !!!🫡🫡🫡
Thankyou so much sir completed samjh aaya 😊
Maja agaya sir ...u r the best teacher in the universe❤❤❤
maza aagya !!
Please provide File handling video as sonn as possible.(exam khatam ho jayenge tb uploade krne ka vichar hai kya)
Maza aa gya❤️❤️
Please create c language file handling lecture and also Java Script tutorial.
Thank you sir
Sir please complete c language krwa
Diziya
Sir 22:49 user tho koi bhi random number daal sakta hai n times yeeh tho jarori hai nhi ki voo ek given range for eg. 1-10 ki hi values dale!! Random numbers ke liye tho yeeh fail ho jayega!
Pleaseeeeeeeee sir make videos on dynamic memory allocation and file handling 🙏🏻🙏🏻🙏🏻 its a request and thank you very much for the wondefuL previous lectures
thank you bhaiya maza aa gya ,sab kuchh samjh aaya.
Mja aa gya sir ❤
maja aa gaya. very useful this c language series.
Sir Jo coding karte he ap us ko hum kese likhy yhe Jo itni sari logical Nishani he for example hum ko j< n-1 likhna he kese pata Chali ab yhe karna he ab yhe karna he dhere dhere is me confusion Hoti he so please help me
Sir file handling k saath saath upto advanced level dsa and memory safety k uper bhi videos bna do help ho jayegi
Sir 1:45:10 if n-4 ,then the loop should go n-5 times..
superb teaching sir🥰
Sir please teach Data structures
sir please make vidoes related to data structure and algorithm of C language..............
Bhut mja aa gya❤