gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Added sentence on comparisons (#30208)

Browse Source
This commit is contained in:
kellyhuang21
2019-02-13 19:36:54 -08:00
committed by Randell Dawson
parent 4b7230001a
commit 0aa4d109d0
1 changed files with 1 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
guide/english/algorithms/sorting-algorithms/selection-sort/index.md
View File

@ -17,6 +17,7 @@ But, how would you write the code for finding the index of the second smallest v
* An easy way is to notice that the smallest value has already been swapped into index 0, so the problem reduces to finding the smallest element in the array starting at index 1. * An easy way is to notice that the smallest value has already been swapped into index 0, so the problem reduces to finding the smallest element in the array starting at index 1.
Selection sort always takes the same number of key comparisons — N(N − 1)/2.
### Implementation in C/C++ ### Implementation in C/C++