int main(int argc, char *argv[])
{
double arr[] = {1,2,3,-1,5.5,5.5};
double arrTwo[] ={10,20,30,40,50};
double *resultArr;
double number = 5.5;
int i, arrSize = sizeof(arr)/sizeof(double);
printf("arr_min = %.3lf \n", arr_min(arr,arrSize));
printf("arr_max = %.3lf \n", arr_max(arr,arrSize));
printf("arr_average = %.3lf \n", arr_average(arr,arrSize));
printf("arr_sum = %.3lf \n", arr_sum(arr,arrSize));
printf("arr_contains %lf, %d times. \n", number, arr_contains(arr,arrSize,number));
puts("Now we merge arays");
resultArr = arr_merge(arr, arrSize, arrTwo,5);
for (i = 0; i < arrSize +5; ++i)
{
printf("arr[%d] = %.3lf \n", i, resultArr[i]);
}
puts("After arr_clear:");
arr_clear(arr,arrSize);
for (i = 0; i < arrSize; ++i)
{
printf("arr[%d] = %.3lf \n", i, arr[i]);
}
return 0;
}
int main()
{
double arrayA[size];
double arrayB[size];
double searchedElement;
int isFound;
printf("Size of arrays is %d.\n", size);
printf("Enter elements of arrayA\n");
for(int i=0; i<size; i++)
{
scanf("%lf", &arrayA[i]);
}
printf("Min element=%.2lf\n", arr_min(arrayA, size));
printf("Max element=%.2lf\n", arr_max(arrayA, size));
printf("Average sum of elements is %lf\n", arr_average(arrayA, size));
printf("Sum of elements is %lf\n", arr_sum(arrayA, size));
printf("Enter element you are looking for: ");
scanf("%lf", &searchedElement);
isFound=arr_contains(arrayA, size, searchedElement);
printf(isFound? "The element is in the array\n":"The element is not in the array\n");
printf("Enter elements of arrayB:\n");
for(int i=0; i<size; i++)
{
scanf("%lf", &arrayB[i]);
}
double *mergedArray=arr_merge(arrayA, arrayB, size, size);
printf("Merged array is:");
for(int i=0; i< 2*size ; i++)
{
printf("%.2lf ", mergedArray[i]);
}
free(mergedArray);
printf("\n");
printf("Cleared array is: ");
arr_clear(arrayA, size);
for(int i=0; i<size; i++)
{
printf("%.2lf ", arrayA[i]);
}
return 0;
}
int main()
{
int numbers[] = { 12, 2, 23, 41, 5, 6, 7, 8, 1 , 4};
int length = sizeof(numbers) / sizeof(int);
int mina = arr_min(numbers, length);
printf("Min is: %d\n", mina);
int max = arr_max(numbers, length);
printf("Max is: %d\n", max);
double average = arr_average(numbers, length);
printf("Average is: %0.4lf\n", average);
long sum = arr_sum(numbers, length);
printf("Sum is: %u\n", sum);
int element = 431;
int contains = arr_contains(numbers, length, element);
if(contains == 1)
{
printf("The array contains: %d\n", element);
} else
{
printf("The array does not contain: %d\n", element);
}
int *ptr = arr_merge(numbers, length, numbers, length);
printf("%d == %d %d == %d \n", ptr[0], ptr[10], ptr[1], ptr[11]);
free(ptr);
arr_clear(numbers, length);
printf("%d %d\n", numbers[0], numbers[1]);
return 0;
}
int main()
{
int n;
if (scanf("%d", &n) != 1)
{
printf("Invalid input!");
return 1;
}
int i;
int numbers[n];
for (i = 0; i < n; i++)
{
scanf("%d", &numbers[i]);
}
int searchedNum;
if (scanf("%d", &searchedNum) != 1)
{
printf("Invalid input!");
return 1;
}
int length = lengthArr(numbers);
int found = arr_contains(numbers, length, searchedNum);
if (found)
{
printf("yes\n");
}
else
{
printf("no\n");
}
return 0;
}
int main()
{
int arr_1[] = {1, 2, 3, 4, 5};
int arr_2[] = {6, 7, 8};
int lenght_1 = LENGHT_ARRAY(arr_1);
int lenght_2 = LENGHT_ARRAY(arr_2);
int min = get_min(arr_1, lenght_1);
printf("min = %d\n", min);
int min_2 = get_min(arr_2, lenght_2);
printf("min_2 = %d\n", min_2);
int max = get_max(arr_1, lenght_1);
printf("max = %d\n", max);
int max_2 = get_max(arr_2, lenght_2);
printf("max_2 = %d\n", max_2);
double average = get_avg(arr_1, lenght_1);
printf("average = %f\n", average);
double average_2 = get_avg(arr_2, lenght_2);
printf("average_2 = %f\n", average_2);
int sum = get_sum(arr_1, lenght_1);
printf("sum = %d\n", sum);
int sum_2 = get_sum(arr_2, lenght_2);
printf("sum_2 = %d\n", sum_2);
bool isContain = arr_contains(arr_1, lenght_1, 5);
printf("isContain 5 = %d\n", isContain);
bool isContain_2 = arr_contains(arr_2, lenght_2, 5);
printf("isContain_2 5 = %d\n", isContain_2);
int *arrMerge;
arrMerge = arr_merge(arr_1, arr_2, lenght_1, lenght_2);
int i;
printf("Merged: ");
for (i = 0; i < (lenght_1 + lenght_2); i++)
{
printf("%d ", arrMerge[i]);
}
printf("\n");
free(arrMerge);
printf("Clearing... \n");
arr_clear(arr_1, lenght_1);
for (i = 0; i < lenght_1; i++)
{
printf("%d ", arr_1[i]);
}
printf("\n");
arr_clear(arr_2, lenght_2);
for (i = 0; i < lenght_2; i++)
{
printf("%d ", arr_2[i]);
}
return (EXIT_SUCCESS);
}
