int main(){
int a[]={3,5,8,9,1,2,11,4};
int length=sizeof(a)/sizeof(a[0]);
SimpleSelectionSort(a,length);
for(int i=0;i<length;i++){
printf("%d ",a[i]);
}
printf("\n");
return 0;
}
// -----------------------------------------------------------------------------
bool Algorithms::Test_SimpleSelectionSort()
{
bool pass = true;
{
int a[] = {};
std::vector<int> v = vec_transform(a, sizeof(a) / sizeof(int));
SimpleSelectionSort(v);
pass = pass && vec_equal(v, a, sizeof(a) / sizeof(int));
}
{
int a[] = {1};
std::vector<int> v = vec_transform(a, sizeof(a) / sizeof(int));
SimpleSelectionSort(v);
pass = pass && vec_equal(v, a, sizeof(a) / sizeof(int));
}
{
int a[] = {1, 2};
std::vector<int> v = vec_transform(a, sizeof(a) / sizeof(int));
SimpleSelectionSort(v);
pass = pass && vec_equal(v, a, sizeof(a) / sizeof(int));
}
{
int a[] = {2, 1};
std::vector<int> v = vec_transform(a, sizeof(a) / sizeof(int));
SimpleSelectionSort(v);
int b[] = {1, 2};
pass = pass && vec_equal(v, b, sizeof(b) / sizeof(int));
}
{
int a[] = {9, 8, 7, 6, 5, 4, 3, 2, 1};
std::vector<int> v = vec_transform(a, sizeof(a) / sizeof(int));
SimpleSelectionSort(v);
int b[] = {1, 2, 3, 4, 5, 6, 7, 8, 9};
pass = pass && vec_equal(v, b, sizeof(b) / sizeof(int));
}
return pass;
}
