![CS Talks by Lee!](/img/default-banner.jpg)
- 39
- 255 916
CS Talks by Lee!
India
เข้าร่วมเมื่อ 18 ม.ค. 2020
CS Talks by Lee! - This channel uploads core subjects of Computer Science including Data Structures, Design and Analysis of Algorithms, Operating Systems, Computer Networks, GATE tutorials, and other helpful videos, for the students to learn the concepts in a scrupulous manner.
To show your support do Like👍🏻 , Share➦, Comment✍🏻 and Subscribe to my channel 'CS Talks by Lee!', and also hit the Bell Icon🔔 to get a notification whenever I upload a new video.
To show your support do Like👍🏻 , Share➦, Comment✍🏻 and Subscribe to my channel 'CS Talks by Lee!', and also hit the Bell Icon🔔 to get a notification whenever I upload a new video.
Analysis of Selection Sort Algorithm | Time complexity of Selection Sort Algorithm | O(n^2)
Selection Sort Algorithm | Full Explanation in detail | How to write program for Selection Sort?:
th-cam.com/video/k44VUPJzT_w/w-d-xo.html
*****************************************************
👍 If you like this video, please hit the Like Button.
✍️ If you have any doubt, please don't hesitate to write Comment.
👆 Stay connect with me by Subscribing Our Channel.
🔔 Click the bell icon to get notified for our latest videos.
➦ If you love this video, please do share the video.
Thank You!!
CS Talks by Lee!
th-cam.com/video/k44VUPJzT_w/w-d-xo.html
*****************************************************
👍 If you like this video, please hit the Like Button.
✍️ If you have any doubt, please don't hesitate to write Comment.
👆 Stay connect with me by Subscribing Our Channel.
🔔 Click the bell icon to get notified for our latest videos.
➦ If you love this video, please do share the video.
Thank You!!
CS Talks by Lee!
มุมมอง: 16 047
วีดีโอ
Selection Sort Algorithm | Full Explanation in detail | How to write program for Selection Sort?
มุมมอง 1.6K2 ปีที่แล้ว
👍 If you like this video, please hit the Like Button. ✍️ If you have any doubt, please don't hesitate to write Comment. 👆 Stay connect with me by Subscribing Our Channel. 🔔 Click the bell icon to get notified for our latest videos. ➦ If you love this video, please do share the video. Thank You!! CS Talks by Lee!
Algorithm Analysis - Lec 9 | Time & Space complexity Practice Problems | GATE & Interview | DAA
มุมมอง 3342 ปีที่แล้ว
Algorithm Analysis Playlist: th-cam.com/play/PLXolM9M3YYK_WsGmZdtrX5gWh0M8Ymeuw.html 👍 If you like this video, please hit the Like Button. ✍️ If you have any doubt, please don't hesitate to write Comment. 👆 Stay connect with me by Subscribing Our Channel. 🔔 Click the bell icon to get notified for our latest videos. ➦ If you love this video, please do share the video. Thank You!! CS Talks by Lee!
What is O(n logn)? | Algorithm Analysis - Lec 8 | Time & Space complexity | GATE & Interview | DAA
มุมมอง 6702 ปีที่แล้ว
Algorithm Analysis - Lec 2: th-cam.com/video/TTHtkhuaupw/w-d-xo.html Algorithm Analysis - Lec 1: th-cam.com/video/1Zr0Z3Hvzxg/w-d-xo.html 👍 If you like this video, please hit the Like Button. ✍️ If you have any doubt, please don't hesitate to write Comment. 👆 Stay connect with me by Subscribing Our Channel. 🔔 Click the bell icon to get notified for our latest videos. ➦ If you love this video, p...
What is O(n^2)? | Algorithm Analysis - Lec 7 | Time & Space complexity | GATE & Interview | DAA
มุมมอง 2652 ปีที่แล้ว
Algorithm Analysis - Lec 2: th-cam.com/video/TTHtkhuaupw/w-d-xo.html Algorithm Analysis - Lec 1: th-cam.com/video/1Zr0Z3Hvzxg/w-d-xo.html 👍 If you like this video, please hit the Like Button. ✍️ If you have any doubt, please don't hesitate to write Comment. 👆 Stay connect with me by Subscribing Our Channel. 🔔 Click the bell icon to get notified for our latest videos. ➦ If you love this video, p...
What is O(max(m+n))? | Algorithm Analysis - Lec 6 | Time & Space complexity | GATE & Interview | DAA
มุมมอง 2902 ปีที่แล้ว
Algorithm Analysis - Lec 2: th-cam.com/video/TTHtkhuaupw/w-d-xo.html Algorithm Analysis - Lec 1: th-cam.com/video/1Zr0Z3Hvzxg/w-d-xo.html 👍 If you like this video, please hit the Like Button. ✍️ If you have any doubt, please don't hesitate to write Comment. 👆 Stay connect with me by Subscribing Our Channel. 🔔 Click the bell icon to get notified for our latest videos. ➦ If you love this video, p...
What is O(log n)? | Algorithm Analysis - Lec 5 | Time & Space complexity | GATE & Interview | DAA
มุมมอง 3452 ปีที่แล้ว
This playlist will give you the in depth understanding of analysis algorithm, so that you can able to analyze any kind of algorithm. DAA Playlist: th-cam.com/play/PLXolM9M3YYK_WsGmZdtrX5gWh0M8Ymeuw.html 👍 If you like this video, please hit the Like Button. ✍️ If you have any doubt, please don't hesitate to write Comment. 👆 Stay connect with me by Subscribing Our Channel. 🔔 Click the bell icon t...
Algorithm Analysis - Lec 4 | Time & Space complexity Practice Problems | GATE & Interview | DAA
มุมมอง 4272 ปีที่แล้ว
This playlist will give you the in depth understanding of analysis algorithm, so that you can able to analyze any kind of algorithm. DAA Playlist: th-cam.com/play/PLXolM9M3YYK_WsGmZdtrX5gWh0M8Ymeuw.html Lecture 2: th-cam.com/video/TTHtkhuaupw/w-d-xo.html 👍 If you like this video, please hit the Like Button. ✍️ If you have any doubt, please don't hesitate to write Comment. 👆 Stay connect with me...
What is O(n)? | Algorithm Analysis - Lec 3 | Time & Space complexity | GATE & Interview | DAA
มุมมอง 3272 ปีที่แล้ว
This playlist will give you the in depth understanding of analysis algorithm, so that you can able to analyze any kind of algorithm. DAA Playlist: th-cam.com/play/PLXolM9M3YYK_WsGmZdtrX5gWh0M8Ymeuw.html 👍 If you like this video, please hit the Like Button. ✍️ If you have any doubt please don't hesitate to write Comment. 👆 Stay connect with me by subscribing Our Channel 🔔 Click the bell icon to ...
What is O(1)? | Algorithm Analysis - Lec 2 | Time & Space complexity | GATE & Interview | DAA
มุมมอง 6262 ปีที่แล้ว
This video will give you the in depth understanding to analysis algorithm - Practice Questions - For gate and interview preparation
Priori and Posteriori Analysis | Algorithm Analysis - Lec 1 | GATE & Interview | DAA
มุมมอง 1K2 ปีที่แล้ว
This video will give you the basic concepts of algorithm analysis. - Priori Analysis - Posteriori Analysis
Analysis of Quick Sort Algorithm | Time complexity of Quick Sort Algorithm | O(n^2) | O(n log n)
มุมมอง 58K3 ปีที่แล้ว
This video will give you an in depth analysis of quick sort algorithm. Best case - O(n log n) Worst Case - O (n^2) Average Case - O(n log n)
Quick Sort Algorithm | Full Explanation in detail | With Example Array
มุมมอง 2.9K3 ปีที่แล้ว
Quick Sort: 1. Full Explanation 2. With Example array 3. Pseudo Code Bubble sort: th-cam.com/video/_Zxeaf21LtM/w-d-xo.html Insertion Sort: th-cam.com/video/myXXZhhYjGo/w-d-xo.html
Time complexity of Insertion Sort | In depth Analysis - Best case, Worst case and Average case
มุมมอง 41K3 ปีที่แล้ว
Insertion Sort Explanation: th-cam.com/video/myXXZhhYjGo/w-d-xo.html Bubble Sort Analysis: th-cam.com/video/CYD9p1K51iw/w-d-xo.html Binary Search Analysis: th-cam.com/video/hA8xu9vVZN4/w-d-xo.html
Insertion Sort Algorithm | Full Explanation with code
มุมมอง 2K3 ปีที่แล้ว
Insertion Sort Algorithm | Full Explanation with code
Time complexity of Bubble Sort | In depth Analysis - Best case, Worst case and Average case
มุมมอง 27K3 ปีที่แล้ว
Time complexity of Bubble Sort | In depth Analysis - Best case, Worst case and Average case
Bubble Sort Algorithm | Explanation with example Sample program | Code Optimization
มุมมอง 1.2K3 ปีที่แล้ว
Bubble Sort Algorithm | Explanation with example Sample program | Code Optimization
Analysis of Binary Search Algorithm | Time complexity of Binary Search Algorithm | O(1) | O(log n)
มุมมอง 76K3 ปีที่แล้ว
Analysis of Binary Search Algorithm | Time complexity of Binary Search Algorithm | O(1) | O(log n)
Binary Search Implementation using C++ | Iterative Method
มุมมอง 5173 ปีที่แล้ว
Binary Search Implementation using C | Iterative Method
Binary Search Algorithm with example | Data Structures
มุมมอง 1K3 ปีที่แล้ว
Binary Search Algorithm with example | Data Structures
C Programming Tutorial - 10 | While loop
มุมมอง 284 ปีที่แล้ว
C Programming Tutorial - 10 | While loop
C Programming Tutorial - 9 | for loop statement
มุมมอง 234 ปีที่แล้ว
C Programming Tutorial - 9 | for loop statement
C Programming Tutorial - 8 | switch statement
มุมมอง 224 ปีที่แล้ว
C Programming Tutorial - 8 | switch statement
C Programming Tutorial - 7 Flow Control Statements | if, else, else if
มุมมอง 1734 ปีที่แล้ว
C Programming Tutorial - 7 Flow Control Statements | if, else, else if
C Programming Tutorial - 6 Arithmetic Operators
มุมมอง 284 ปีที่แล้ว
C Programming Tutorial - 6 Arithmetic Operators
C Programming Tutorial - 5 Return Type | Return type of scanf() and printf()
มุมมอง 3584 ปีที่แล้ว
C Programming Tutorial - 5 Return Type | Return type of scanf() and printf()
C Programming Tutorial - 4 scanf() with multiple inputs
มุมมอง 7K4 ปีที่แล้ว
C Programming Tutorial - 4 scanf() with multiple inputs
average case not discussed!
Thank You Maam!!
nicely explained worst case where many did not ! thanks..
Simple and straight forward. ❤❤❤
Can you also provide analysis of decending array worst case
Mam will you please upload next videos
Nice explanation but where's the AVG case
Best explanation ever
Thanks!
I don't know why your channel has few subscribers
mam for average ,when we say quicksort algorithm is average
Thanks
what is the array size is 7, then what will be the num of comparison because its coming 2.8073, how should I approach for the comparisons?
I didn't get the part where u used n/2 for the worst case could you explain it please
Great explaination
Thanks
thaaaaaaaaanks
amazing video thanks
💝
please do video on average case analysis for quick sort
with n=8; is there any chance we can generate best case array for a quick sort algorithm, please clarify? thank you. for example, we choose pivot as middle of array.
I have started watching your videos recently. You teach step by step and in an orderly manner. From this point of view, I can say that if you continue, you have potential to convert this channel in the top list of the youtube channels for learning CS concepts. Best of luck!
so does that mean that the worst case will change to nlogn if we take the median as pivot????
It reduces the likelihood of worst case scenario, but does not guarantee to O(n log n) always, because median is depending on the distribution of data and to select median again sorting is required. Hope it helps you!!
Madam when will you upload your next video... ?
you're the best ! thank you !
Very nice lecture 😊. One can understand easily
thank you mam
The best case running time of bubble sort O(n) or 0(n^2) This question given in previous examination I am so confused
Why the two loops will run u should have mentioned that no 🙂
Hi, Is there a way to solve this problem? Thank you. Derive the worst-case running time complexity of the following function: a(n) = { 1 for n ∈ {0, 1, 2, 3}, a(n) = a(n − 1) + a(n − 2) + a(n − 3) + a(n − 4) for n ≥ 4 .
Thank you so much Madam...We want more teachers like you....Absolutely, well explained...I didn't know whether it was easy or tough however you made it easy...Again, Thank you...
Are u not going to upload any videos in future?
Algorithm A and B have a worst-case running time of O(n) and O(log n), respectively. Identify the algorithm that runs faster and critically explain why
GREAT! IT WAS REALLY HELPFULL FOR ME. THAKS ALOTTTTTTTTTTTTTTTTTTTTTTTTTTTTTT
Good explanation mam. But I want average case too
Hi. Thank you very much for your lessons. They really helped me to understand the Big O topic and time and space complexity of algorithms. Thanks a lot.
Best video with clear cut explanation.Thanks for your video .Please Continue and do more videos .Dont Stop.
Sure.
I was so confused about why the n was divided by 2 now i get it
Thanks
thank u
tysm
O(n)🙃
Why binary search is used only for ascending order why not descending order
Thanks✌🏻
what if we know m is bigger then n, is O(m) then?
Yes, if you know the maximum(m Or n), then you can directly use it. (O(m) or O(n)).
thank you maam love it
very nice explanation and make a difficult concept simple to Understand thanks I subscribed to you and I hope you will upload nice content thanks
Thank you so much for helping me understand this basic concept :)