Selection sort another approach

#1

i have done same thing with another approach by shifting largest element to last …
here is my program please see its valid or not

https://ide.codingblocks.com/s/188642

thanks in advance

#2

i should start from 1.
rest is okay

#3

sorry but i dont get it why i should start with 1 @abhinavsingh

#4

if(a[j] > a[j+1])
and j goes till n-i, if i is zero than j goes till n, now j+1 will become out of bound.