// SelectionSort
#include <stdio.h>
#include <stdlib.h>
void printA(int a[], int n){
int i;
for(i=0;i<n;i++){
}
}
void swap(int* a, int* b){
int tmp;
tmp = *a;
*a = *b;
*b = tmp;
}
//選択ソート関数
void SelectionSort(int a[], int n){
//ここを書き換える
int i, j, min;
for(i = 0; i < n - 1; i++){
min = i; // 最小値のインデックス
for(j = i + 1; j < n; j++){
if(a[j] < a[min]){
min = j;
}
}
// 最小値を先頭に交換
if(min != i){
swap(&a[i], &a[min]);
}
}
}
int main(void){
int n,i;
int *v;
v
= (int*)malloc(sizeof(int)*n
); if(v==NULL){
return -1;
}
for(i=0;i<n;i++){
}
SelectionSort(v,n);
printA(v,n);
return 0;
}
Ly8gU2VsZWN0aW9uU29ydAoKI2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlIDxzdGRsaWIuaD4KCnZvaWQgcHJpbnRBKGludCBhW10sIGludCBuKXsKICAgIGludCBpOwogICAgZm9yKGk9MDtpPG47aSsrKXsKICAgICAgICBwcmludGYoIiVkICIsYVtpXSk7CiAgICB9CiAgICBwcmludGYoIlxuIik7Cn0KCnZvaWQgc3dhcChpbnQqIGEsIGludCogYil7CiAgICBpbnQgIHRtcDsKICAgIHRtcCA9ICphOwogICAgKmEgPSAqYjsKICAgICpiID0gdG1wOwp9CgovL+mBuOaKnuOCveODvOODiOmWouaVsAp2b2lkIFNlbGVjdGlvblNvcnQoaW50IGFbXSwgaW50IG4pewoJLy/jgZPjgZPjgpLmm7jjgY3mj5vjgYjjgosKCWludCBpLCBqLCBtaW47CgogICAgZm9yKGkgPSAwOyBpIDwgbiAtIDE7IGkrKyl7CiAgICAgICAgbWluID0gaTsgIC8vIOacgOWwj+WApOOBruOCpOODs+ODh+ODg+OCr+OCuQoKICAgICAgICBmb3IoaiA9IGkgKyAxOyBqIDwgbjsgaisrKXsKICAgICAgICAgICAgaWYoYVtqXSA8IGFbbWluXSl7CiAgICAgICAgICAgICAgICBtaW4gPSBqOwogICAgICAgICAgICB9CiAgICAgICAgfQoKICAgICAgICAvLyDmnIDlsI/lgKTjgpLlhYjpoK3jgavkuqTmj5sKICAgICAgICBpZihtaW4gIT0gaSl7CiAgICAgICAgICAgIHN3YXAoJmFbaV0sICZhW21pbl0pOwogICAgICAgIH0KICAgIH0KfQoKaW50IG1haW4odm9pZCl7CiAgICBpbnQgbixpOwogICAgaW50ICp2OwogICAgc2NhbmYoIiVkIiwmbik7CiAgICB2ID0gKGludCopbWFsbG9jKHNpemVvZihpbnQpKm4pOwogICAgaWYodj09TlVMTCl7CiAgICAgICAgcHJpbnRmKCJFUlJPUlxuIik7CiAgICAgICAgcmV0dXJuIC0xOwogICAgfQogICAgZm9yKGk9MDtpPG47aSsrKXsKICAgICAgICBzY2FuZigiJWQiLCZ2W2ldKTsKICAgIH0KICAgIFNlbGVjdGlvblNvcnQodixuKTsKICAgIHByaW50QSh2LG4pOwogICAgZnJlZSh2KTsKICAgIHJldHVybiAwOwp9Cg==