void main(void)
{
int y[10] = {3, 2, 4, 1, 6, 9, 8, 7, 5, 0};
SelectionSort(y,10);
for (int i = 0; i < 10; i++)
cout << y[i] << ' ';
}
int main(void)
{
int *array, size;
printf("Enter the size of array = ");
scanf("%d", &size);
array = (int *)malloc(size * sizeof(int));
printf("\nInput numbers to be sorted\n");
for(int i = 0; i < size; i++)
{
printf("%d: ", i + 1);
scanf("%d", &array[i]);
}
SelectionSort(array, size);
printf("Ouput\n");
for(int i = 0; i < size; i++)
printf("%d\n", array[i]);
free(array);
return 0;
}
int main(){
int arr[]={2,1,4,3,8,6,7};
int n=sizeof(arr)/sizeof(arr[0]);
SelectionSort(arr,n);
printf("\nSorted\n");
int i;
for(i=0;i<n;i++){
printf("%d ",arr[i]);
}
return 0;
}
int main(){
int i,n,a[TAM_MAX];
// Inicializar gerador de números aleatórios
srand((unsigned)time(NULL));
// Vetor gerado aleatoriamente
n = (rand() % TAM_MAX)+1;
printf("Vetor original: ");
for (i = 0; i < n; i++)
{
a[i] = (rand() % 100);
printf("%d ",a[i]);
}
printf("\n");
// Classificar vetor
SelectionSort(a,n);
printf("Vetor ordenado: ");
for (i = 0; i < n; i++)
printf("%d ",a[i]);
printf("\n");
system("PAUSE");
return 0;
}
int main() {
int A[6] = {6, 5, 5, 3, 100, 1};
SelectionSort(A, 6);
printf("%d, %d, %d, %d, %d, %d\n", A[0], A[1], A[2], A[3], A[4], A[5]);
return 0;
}
int main(void) {
int i;
int *arr;
unsigned int size;
printf(division_line);
printf("<"SORTNAME">\n");
/* <-동적할당 코드 START-> */
printf("배열의 크기 입력>> ");
scanf("%u",&size);
arr = (int*) malloc(sizeof(int)*size);
/* <-동적할당 코드 END-> */
printf("\n[%d개 입력]>> ", size);
for(i=0;i<size;i++)
scanf("%d",&arr[i]);
SelectionSort(arr, size);
printArr(arr, size);
printf(division_line);
println();
}
int main(void){
int N,i,j,num = 0;
char cards[CARDS][3];
char Bubble[CARDS][3];
char Selection[CARDS][3];
char check[NUMBER][SUIT+1] = {0};
char Bubblecheck[NUMBER][SUIT+1] = {0};
char Selectioncheck[NUMBER][SUIT+1] = {0};
scanf("%d" ,&N);
for(i = 0;i < N;i++){
scanf("%s", cards[i]);
}
/*copy array*/
memcpy(Bubble,cards,sizeof cards);
memcpy(Selection,cards,sizeof cards);
Checker(cards,check,N);
BubbleSort(Bubble,N);
Checker(Bubble,Bubblecheck,N);
StableChecker(Bubblecheck,check);
SelectionSort(Selection,N);
Checker(Selection,Selectioncheck,N);
StableChecker(Selectioncheck,check);
return 0;
}
void main(){
int list[10]={1,4,7,4,5,4,3,6,9,10};
int* list2;
list2 = SelectionSort(list,10);
printArray(list2,10);
getche();
}
void main()
{
int i;
int shuzu[SIZE];
srand(time(NULL));
for(i=0;i<SIZE;i++)
{
shuzu[i] = rand()/1000 + 100;
}
printf("排序前：\n");
for(i=0;i<SIZE;i++)
{
printf("%d ",shuzu[i]);
}
printf("\n");
SelectionSort(shuzu,SIZE);
printf("排序后：\n");
for(i=0;i<SIZE;i++)
{
printf("%d ",shuzu[i]);
}
printf("\n");
}
int main() {
int array_size = __VERIFIER_nondet_int();
if (array_size < 1) {
array_size = 1;
}
int* numbers = (int*) alloca(array_size * sizeof(int));
SelectionSort(numbers, array_size);
return 0;
}
int main(int argc, char* argv[])
{
std::vector<int> v = {-1,5,-9,3,-3,4,4,2,1};
Print(BubbleSort(v));
Print(InsertSort(v));
Print(SelectionSort(v));
std::cout << "--------------" << std::endl;
return EXIT_SUCCESS;
}
main(){
// 1. Declare three integer arrays as follows */
int a[50], b[70], c[120];
// 2. implement a function set_array_rand(int x[], int n) and call it to generate the values in array a and b randomly. */
SetArrayRand(a, 50);
SetArrayRand(b, 70);
/* 3. using the selection_sort(double x[], int n) function we implemented in class, sort the elements in a and b arrays. */
SelectionSort(a, 50);
SelectionSort(b, 70);
/* 4. implement a MERGE function and call it as follows tomerge the values in arrays a and b into array c such that the values in c will be sorted after merging */
Merge(a, 50, b, 70, c, 120);
/* 5. print the values in array c */
PrintArray("Array c", c, 120);
}
void main()
{
printf("Initialize Data\n");
MakeRandomNumber();
DisplayBuffer();
printf("Sort end Data\n");
SelectionSort();
DisplayBuffer();
printf("\n");
}
void
Dim::Quicksort( float** d, int left, int right)
{
if(left < (right- 15)) {
int split_pt = Partition(d,left, right);
Quicksort(d, left, split_pt);
Quicksort(d, split_pt+1, right);
}
else SelectionSort(d, left, right);
};
int main ()
{
FILE *input;
FILE *output;
input = fopen("input.txt","r");
output = fopen("output.txt","w");
int i, j, min, temp;
int n,k;
int A[10];
int a;
fscanf(input,"%d",&n);
printf("n is %d\n\n",n);
fscanf(input,"%d",&k);
printf("k is %d\n\n",k);
printf(" Array befare sorting\n");
for(i=0;i<n;i++)
{
fscanf(input,"%d",&a);
A[i] = a;
printf("%d\n",A[i]);
}
for(i=0; i<n ;i++)
{
printf("\n%d ",A[i]);
}
printf("\n\n");
if(k<=n/2)
SelectionSort(A,n,k);
else
BubbleSort(A,n,k);
int b=A[k-1];
printf("A[k] is %d\n", A[k-1]);
fprintf(output,"%d",b);
fclose(output);
system("pause");
return 0;
}
int main(){
int array[10] = {1,4,2,3,13,10,12,0,8,5};
int i;
for(i=0; i<10; i++)
printf("%d ",array[i]);
printf("\n");
//Bubblesort(array, 10);
SelectionSort(array, 10);
//QuickSort(array,0,9);
for(i=0; i<10; i++)
printf("%d ",array[i]);
return 0;
}
int main()
{
int array[] = {21, 25, 49, 25, 16, 8};
int len = sizeof(array) / sizeof(*array);
println(array, len);
SelectionSort(array, len);
println(array, len);
return 0;
}
int main() {
int n;
scanf("%d",&n);
int *p = (int*)malloc(sizeof(int)*(n+1));
for (int i = 1; i <=n; i++)
{
scanf("%d", &p[i]);
}
SelectionSort(p,n);
return 0;
}
void test_SelectionSort() {
int a[6] = {4,2,3,5,1,0};
int b[6] = {0,1,2,3,4,5};
int i;
SelectionSort(a, 6);
if ( memcmp(a, b, sizeof(a)) == 0 )
printf("SelectionSort test passed!\n");
else {
printf("SelectionSort test failed!\n");
for ( i=0; i<6; i++ )
printf("test_SelectionSort: %d-%d\n", i, a[i]);
}
}
int main(void){
int array[SIZE],i;
for(i=SIZE-1; i>=0; i--)
array[i]=i;
SelectionSort();
for(i=0; i<SIZE; i++)
assert(array[i]==i);
}
int main(){
int arr[] = {10, 20, 3, 5, 1, 2, 6, 8, 9, 40 };
int size = sizeof(arr)/sizeof(arr[0]);
printf ("%d elements to be sorted using selection sort\n", size);
SelectionSort(arr, size);
printf ("Array Elements after Selection Sort: ");
print_elements(arr, size);
return 0;
}
int main()
{
aType testArray[] = { 7, 13, 1, 3, 10, 5, 2, 4 };
int nA = sizeof(testArray)/sizeof(aType);
cout << "nA: " << nA << endl;
cout << "Initial array contents:" << endl;
PrintArray( testArray, nA );
SelectionSort( testArray, nA );
cout << "Final array contents:" << endl;
PrintArray( testArray, nA );
}
int main() {
int array_size = __VERIFIER_nondet_int();
if (array_size < 1 || array_size >= 2147483647 / sizeof(int)) {
array_size = 1;
}
int* numbers = (int*) alloca(array_size * sizeof(int));
for(int i = 0; i < array_size; i++)
{
numbers[i] = __VERIFIER_nondet_int();
}
SelectionSort(numbers, array_size);
return 0;
}
int main(void){
int array[SIZE];
int i;
for(i=SIZE-1; i>=0; i--)
array[i]=i;
SelectionSort();
for(i=0; i<SIZE; i++)
nse_assert(array[i]==i);
return 0;
}
int main(int argc, char * argv[])
{
int arr[] = {2,3,1,5,34,123,11,2,1,23};
int size = sizeof(arr) / sizeof(arr[0]);
// BubbleSort(arr, size, 0);
// InsertionSort(arr, size, 0);
SelectionSort(arr, size, 0);
for(int i(0); i < size; ++i)
{
std::cout << std::setw(4) << arr[i];
}
std::cout << std::endl;
return 0;
}
int main(int argc, char const *argv[])
{
/* code */
int size;
scanf("%d", &size);
int * number_array = (int *) malloc (size * sizeof(int));
for (int i = 0; i < size; i++) {
scanf("%d", &number_array[i]);
}
SelectionSort(number_array, size);
for (int i = 0; i < size; i++) {
printf("%d\t", number_array[i]);
}
return 0;
}
void LIS_Ordenar(Lista lista) {
SelectionSort(lista);
/*
int aux;
No no = lista->cabeca->proximo;
for(int i=1; i < lista->tamanho;i++){
if (no->valor > no->proximo->valor){
aux = no->valor;
no->valor = no->proximo->valor;
no->proximo->valor = aux;
}
no = no->proximo;
}
*/}
void Merge(int a[], int na, int b[], int nb, int c[], int nc)
{
// merge the values in a and b into c while keeping the values sorted. For example, suppose we have the following two Arrays a = { 3, 7, 9, 12} and b = {4, 5, 10}
//When we merge these two arrays, we will get
//c = {3, 4, 5, 7, 9, 10, 12}
/* YOUR CODE */
//not yet the programming God so yes I will be using two for loops
// this loops fill the array with all values
int i = 0;
for (i ; i < nc; i++){
if (i<na){
c[i] = a[i];
}
else{
c[i] = b[i];
}
}
//this already sorts it, the instructions were not clear about duplicate values so I just used the method already given to us
SelectionSort(c,nc);
}
int main(void){
int arr[] = {10, 1,2, 3,4,5,6,7,8,9};
int n = sizeof(arr)/sizeof(arr[0]);
printArray(arr, n);
// int index = BinarySearch(arr, 9, 12);
// int index = BinarySearch_in_Sorted_Rotated_Array(arr, n);
// if (index>=0){
// printf("\nThe index of min element is at %d index and its value is %d", index, arr[index]);
// }
// else{
// printf("\nElement Not Found. \n");
// }
//bubbleSort(arr, n);
//InsertionSort(arr,n);
SelectionSort(arr, n);
printf("\nSorted array: \n");
printArray(arr, n);
return 0;
}
int main()
{
int a[SIZE]={10,5,2,0,-1,-2000,0,5,9,4}, i;
printf("Selection Sort in an Array\n\n");
//for(i=0; i<SIZE; ++i)
//{
//printf("Enter value %d:", i+1);
//scanf("%d",&a[i]);
//}
SelectionSort(a, SIZE);
printf("\nArray after being sorted: ");
for(i=0; i<SIZE; ++i)
{
printf("%d ", a[i]);
}
return 0;
}
