This is almost like online tuition. You can ask questions and even request videos. We can try to get them. :)

Did you see our merge sort video? Its quite simplified. You may start loving recursion once it settles well in your head.

I saw a lot of comments below asking for new videos from this guy, This is 2020 and it has been 7 years since this video was posted and the content is top-notch. However the author is no more and suffered a loss of life by a speeding car while crossing a road. May he rest in peace.

These videos are really awesome.Please post more videos on C programming and if possible on java,python,c++ or any other language you want or on data structures and algorithms because you are doing a great job. Your videos helped me a lot.You make things simple and concise.

We are always comparing with A[iMin] i.e the current minimum,, so, its against 7, then against 4 and then against 2. Its not always against 7 because iMin is getting updated.

I LOVE YOU! Thanks for these clips!

One of the greatest lecture of all time on algorithm!

I just love you. You teach the way I learn !

Rest in Peace Harsha. You will be remembered through your amazing work.

I really appreciate your work...one of the best channel for DS & Algo...Please make more videos

It was difficult for me to understand but you made me understand in 10 minutes. Thanks

amazing explanation, hats off to you sir, keep it up 👍👍

some of the best material online period

Great tutorials! Keep it up i appreciate it!

thank u soo much for these good tutorials.

very gratuful for you man , this really gave an overview of sorting algorithms

Amazing vids. Thanks for making them.

Sir hats off to you the best lectures on sorts i have ever heard thankyou so much

Best explanation I ever found for sorting. Thanks alot sir for the easiest approaches you shared with us .😊😊

Thank you so much, will probably binge watch your videos for my upcoming DSA exam

Love his voice

thanks bro. your teaching way is impressive.....

loving your videos!!

You help me so much Thanks for your brilliant tutorial!!!

all da videos r just mind blowing

This helps me a lot in my exam..thnkzzzzzz a lot

amazing video, you make it so simple..

There's an error in the pseudocode. It's: for i

this vid also taught me time complexity calculation wow! hats off....

great work..it really very helpful

U saved my life

this was so helpful man. Thanks

Good job! Nice lecture! :)

Thank you!!! Awesome teaching...

It's too good👍👍 i understood very easily bro Your language accent is so good and sweet

*nicely explained..loved it*

*_This guy sounds the same as the one on neso academy_*

nice explanation... thank you for these videos..

it probably would make sense to add another "if" statement, to check if the min is different from i (then swap is needed). Right now, we are swapping every time, even when it is not needed

You are good at teaching and creating panel Thank you

Dude, please keep making videos...we need you, even in 2021...please

Such a masterpiece! It is still no.1 in 2023

dear sir, we are following ur entire content please update this course with more algorithms , please bros who like this series give thumbs . (from india)

Thank you sir for that video it's very helpful for me

Great explanation

Excellent explanation :)

These are fantastic and very clear. Great video!

Great lesson, I think the final code can be optimized... void selectionSort(int* A, int n){ int temp; // temporary variable for (int i=0; i < n-1; i++){ // n-2 passes (last element comparisons are not necessary) for (int j=i+1; j < n; j++){ if (A[j] < A[i]){ // there's a smaller value ahead temp = A[i]; // interchange positions A[i] = A[j]; A[j] = temp; } } }

Really superb..

great lecture

*Amazing sir*

excellent explanation

Great video! This was a much clearer explanation than when i took this class in college. Quick question, why would you want/need to pass in the length of the array. Are you assuming that this is being implemented in languages without built in arrays with a find/return length function? It seems like it would be unnecessary for a user to input the length.

*best lecture*

Nice,and easy,clear

thank you!

please do the lecture for file pointers i.e, lecture on streams..... we are having a lot of trouble in learning that....... thank you for all the lectures till now.....

Nice explanation.. but can you please upload video for Heap Sort and Radix sort?

Excellent explanation...we should make videos... excellent...

great videos sir.. :)

I found it complicated than other explanations..Why can t you have variable to hold the index of minimum value from each pass. Then swap the first element and the minimum element. So in next pass start from 2nd element to find second element and so on...

Good work👍🏻👍🏻👍🏻

It's really nice...

I think for selection sort, time complexity for best case should be O(n) because if one traverses through the already sorted list, then one can always come out of it after finding that it is already sorted instead of traversing again. Here is my code : int temp, min = 0, index = 0; bool swap = true; for(int i = 0; i < num && swap; i++) { min = arr[i]; swap = false; for(int j = i; j < num - 1; j++) { if(min > arr[j+1]) { min = arr[j+1]; index = j+1; swap = true; } } if(swap == true) { temp = arr[i]; arr[i] = min; min = temp; arr[index] = min; } }

beautiful !

Can we improve algo by running c3 only if iMin is changed in c2?

thank u sir amazing algorithm thanks again

Thank you sir.....

Selection sort. In computer science, selection sort is a sorting algorithm, specifically an in-place comparison sort. It has O(n2) time complexity, making it inefficient on large lists, and generally performs worse than the similar insertion sort.

You mentioned that this algorithm is slow, but technically, it is not if n (size of the array) is small. As n gets bigger, it can begin to get slower yes.

*thank you so much sir*

Thanks dude.

Thanks a lot

instead of n could replace by array.length or return new arr[] will be more efficient

Hi, I recently found out about your channel and why did you stop making videos you are so good at it. Its a request if you could upload more videos about cs if possible. Love your work

in 2021 also best series to learn Ds

helpful.. thanks :)

Normally I am not into correcting grammar mistakes but since you say it in every video: first not 1th great videos btw!!

*very helpful*

The way you explain your selection sort and how you code your selection sort function is actually different in my opinion.

Superb..

*Thanks Animesh*

Wouldn't the part with the cost "c1" be executed "n - 2" times? Since you are starting with the index 0 till n-2 which makes (n - 2) - 0 + 1 = n - 1 for the loop header of the outer loop. Then n - 2 for the statements inside the loop.

thank u sir....

thanks a lot

There is a mistake at 2:37, it is supposed to be the second smallest element and not second-largest. Thank you for the videos, they are absolutely amazing :)

thanks dude

nice.. thanks..

May I ask what is the algorithm used in wordscapes?

*Splendid*

*nice one*

please upload a lecture on linkedlist

*thanks*

nth term in arithmetic series is calculated by a (sub n) = n ( (a1 + a (sub n) )/ 2 ) , if last term is 1, and first is (n-1), how do you get n(n-1) / 2

Array bhai bhai bhai bhai

Please provide videos on heap sort also

thank you :)

Hi , Do you have Brute-force algorithms tutorial ? Please let me know asap ! Thanks

your tutorials r like my home tutor..:v thank you so much. but the subtle slide hinders understanding sometimes

Please do a tut on counting sort, my mid is in November 1st :(