Selection Sort Algorithm Analysis

Selection sort algorithm analysis

Easy Algorithm Analysis Tutorial:

►Please Subscribe !

►Videos:
Recurrence Relation Run Time by Induction:

►Visit my Website:

►Summation Formulas:

►RESOURCES:

Helpful Books:
Algorithm Analysis Books:

Discrete Mathematics Workbooks:

[smitkothari]

i have my exam in 3 hours and this is gonna come really handy

[s_ensei]

Thanks a lot man, this is the only video on the matter that made perfect sense
You're a lifesaver

[AlexGomez-rvny]

Very nice explanation bro, my first comment but i've watching your videos since months ago, they're excellent, keep it up.!

[Burak-pljl]

You deserve more views and subscribers man!
I think this is the best "real" step by step analysis video of selection sort.

Thank you! ^^

[Jay-gwtk]

Hey I just wanted to say thank you. This is super helpful.

[ednakazuya]

i still don’ understand how you got 1/2(n^2+n)?

[helanomiguel]

Congrstulstions for the video and thank you. Just a comment, i think your outter for should run to n-1, because in the last loop cicle the largest number is gointo to be in the last position already

[Josegarcia-dqrt]

i think C3 equals ((n^2+n)/2) + n, and C4 equals (n^2+n)/2

[DaniloSouzaMoraes]

so is it right to say that selection sorts run time is O((n^2+2)/2) that is equivalent to O(n^2)?

[uzair]

it would be really better if you have did the math part at last

[benb.]

first loop should go to < N-1 since you can’t look right of the last index

Is it supposed to be i=0 to n-1, not n? Even the array starts at zero, you wrote 'to n' in for section.

[rodrigoandresburciagaornel]

I think you are wrong in the analysis of line c3 because you are telling that the inner loop is running two summations so that is wrong, the inner loop is only running the first one that is (n ( n+ 1) )/2 if you do the analysis with two summations it will take exactly n²

[jifdwcb]

Add it next time :( my professor is crazy