11_sorts: more tight boundary for selectionSort() and remove minValue
11_sorts: more tight boundary for selectionSort() and remove minValue

It is for sure a[i] == a[j], when i == j. So we could skip those cases.

And minValue could be represented by a[minIndex], so replace minValue
with a[minIndex].

Signed-off-by: Wei Yang <625b313770607d27ce1f12b6d57a9f50d742bd94@gmail.com>

wangzheng0822/algo,wangzheng0822/algo,wangzheng0822/algo,wangzheng0822/algo,wangzheng0822/algo,wangzheng0822/algo,wangzheng0822/algo,wangzheng0822/algo,wangzheng0822/algo,wangzheng0822/algo,wangzheng0822/algo,wangzheng0822/algo,wangzheng0822/algo,wangzheng0822/algo