Selection Sort c++

#include
#include

class selec{

public :
void input();
void output();
void tukar(int& , int& );
void minimum( int, int,int&);
void selection();

private:
int a[100];
int n;
};

void selec::input()
{
cout << "masukkan banyaknya data :"; cin >> n;

for (int i=0; i< n; i++) {cout << "a["<> a[i];}

}
void selec::output()
{
cout << "setelah di sorting"< for (int j=0; j {cout << "a["< }

void selec::tukar(int &a, int &b )
{
int temp;

temp=a;
a=b;
b=temp;
}

void selec::minimum( int dari, int n,int &tempat)
{
int i, min;
min=a[dari];
tempat=dari;
for (i=dari+1; i {if(a[i] {
min=a[i];
tempat=i;}
}
}

void selec::selection()
{
int i, t;
for (i=0; i {minimum(i, n, t);
tukar(a[i],a[t]);
}
}

int main()
{
selec x;
x.input();
x.selection();
x.output();

getch();

return 0;
}

Selection Sort java

public class SelectionSort{
public static void main(String[] args){
int[] angka = {3,2,1};
int i, j, temp,tampung;
System.out.println("Sebelum diurutkan :");
for(i=0;i < angka.length;i++)
System.out.print(angka[i]+" ");
System.out.println("\n");

for (i=0; i < angka.length-1;i++){
int minindek=i+1;
for(j=minindek+1;j < angka.length;j++){
if(angka[j] < angka[minindek])
minindek=j;
}
if(angka[minindek] < angka[i]){
tampung=angka[i];
angka[i]=angka[minindek];
angka[minindek]=tampung;
}
for(int k=0; k < angka.length;k++)
System.out.print(angka[k]+"\t");
System.out.println();
}
System.out.println("Setelah diurutkan : ");
for(i=0; i < angka.length;i++)
System.out.print(angka[i]+" ");

}
}