x i j Besar indeks
18,3,9,8,28,2 5 1 18 0
2 - -
3 - -
4 28 4
5 - -
6 - -
18,3,9,8,2,28 4 1 18 0
2 - -
3 - -
4 - -
5 - -
2,3,9,8,18,28 3 1 2 0
- 3 1
2 9 2
3 - -
4
2,3,8,9,18,28 2 1 2 0
- 3 1
2 8 2
3
2,3,8,9,18,28 1 1 2 0
- 3 1
2
2,3,8,9,18,28 0
Algoritma : selection sort
void select short (int x ,int n)
{ int I , indeks , besar , j ;
for ( I = n-1 ; i > 0 , i - - )
{ besar = x [0] ;
Indeks = 0 ;
for ( j = 1 ; j , < = i ; j + + ) if ( x [ j ] > besar)
{ besar = x [ j ]
Indeks = j
}
X [ indeks ] = x [ i ]
X [ i ] = besar
} // end for
} // end select short
Tidak ada komentar:
Posting Komentar